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