Other (40)
11781.
Other
Genetic Algorithms within the Framework of Evolutionary Computation, (1994)
11782.
Other
A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron, (1993)
11783.
Other
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities, (1991)
11784.
Other
Dynamic Perfect Hashing: Upper and Lower Bounds, (1991)
11785.
Other
Can a maximum flow be computed in $o(nm)$ time?, (1990)
11786.
Other
Constructive Hopf's theorem: or how to untangle closed planar curves, (1988)
11787.
Other
A Faster Approximation Algorithm for the Steiner Problem in Graphs, (1987)
11788.
Other
A Lower Bound for the Complexity of the Union-Split-Find Problem, (1986)
11789.
Other
Area-time optimal division for T=omega((logn)1+epsilon), (1985)
11790.
Other
On BF-perfect graphs, (1985)
11791.
Other
Algorithms for routing in planar graphs, (1984)
11792.
Other
Routing through a generalized switchbox, (1984)
11793.
Other
Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof, (1984)
11794.
Other
Four results on the complexity of VLSI computations, (1983)
11795.
Other
VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System, (1983)
11796.
Other
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time, (1983)
11797.
Other
Routing through a Rectangle, (1983)
11798.
Other
Granularity of parallel memories, (1983)
11799.
Other
Cost tradeoffs in graph embeddings, with applications, (1982)
11800.
Other
Optimal dynamization of decomposable searching problems, (1980)