Sonstige (40)
11781.
Sonstige
A Faster Approximation Algorithm for the Steiner Problem in Graphs, (1987)
11782.
Sonstige
A Lower Bound for the Complexity of the Union-Split-Find Problem, (1986)
11783.
Sonstige
Area-time optimal division for T=omega((logn)1+epsilon), (1985)
11784.
Sonstige
On BF-perfect graphs, (1985)
11785.
Sonstige
Algorithms for routing in planar graphs, (1984)
11786.
Sonstige
Routing through a generalized switchbox, (1984)
11787.
Sonstige
Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof, (1984)
11788.
Sonstige
Four results on the complexity of VLSI computations, (1983)
11789.
Sonstige
VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System, (1983)
11790.
Sonstige
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time, (1983)
11791.
Sonstige
Routing through a Rectangle, (1983)
11792.
Sonstige
Granularity of parallel memories, (1983)
11793.
Sonstige
Cost tradeoffs in graph embeddings, with applications, (1982)
11794.
Sonstige
Optimal dynamization of decomposable searching problems, (1980)
11795.
Sonstige
An O(n log n) lower bound for the synchronous circuit size of integer multiplication, (1976)
11796.
Sonstige
A game on graphs, (1975)
11797.
Sonstige
Polynomial and abstract subrecursive classes, (1974)
11798.
Sonstige
On the Size of Sets of Computable Functions, (1973)
11799.
Sonstige
The "almost all" theory of subrecursive degrees is decidable, (1973)
Manuskript (3)
11800.
Manuskript
Computing with algebraic curves in generic position. (2007)