Other (40)
11881.
Other
On BF-perfect graphs, (1985)
11882.
Other
Algorithms for routing in planar graphs, (1984)
11883.
Other
Routing through a generalized switchbox, (1984)
11884.
Other
Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof, (1984)
11885.
Other
Four results on the complexity of VLSI computations, (1983)
11886.
Other
VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System, (1983)
11887.
Other
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time, (1983)
11888.
Other
Routing through a Rectangle, (1983)
11889.
Other
Granularity of parallel memories, (1983)
11890.
Other
Cost tradeoffs in graph embeddings, with applications, (1982)
11891.
Other
Optimal dynamization of decomposable searching problems, (1980)
11892.
Other
An O(n log n) lower bound for the synchronous circuit size of integer multiplication, (1976)
11893.
Other
A game on graphs, (1975)
11894.
Other
Polynomial and abstract subrecursive classes, (1974)
11895.
Other
On the Size of Sets of Computable Functions, (1973)
11896.
Other
The "almost all" theory of subrecursive degrees is decidable, (1973)
Manuscript (3)
11897.
Manuscript
Computing with algebraic curves in generic position. (2007)
11898.
Manuscript
Polynomial parametrization of nonsingular algebraic curves. (2007)
11899.
Manuscript
ECLIPPSE: Environment for Chemical Library Inspection, Pre- and Postprocessing, and Screening Evaluation. User Guide. (2003)