Title	Publication Date	Language	Citations
A Method of Constructing Selection Networks with $O(\log n)$ Depth	1996/08/01	English
Existence and Construction of Edge-Disjoint Paths on Expander Graphs	1994/10/01	English
An Extension of Computational Duality to Sequences of Bilinear Computations	1978/02/01	English
The Time Measure of One-Tape Turing Machines Does Not Have the Parallel Computation Property	1978/02/01	English
Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set	1991/12/01	English
An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems	1995/08/01	English
A Fast Derandomization Scheme and Its Applications	1996/02/01	English
Complexity-Restricted Advice Functions	1994/04/01	English
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions	1996/02/01	English
Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences	1994/02/01	English
Uniform Interpretations of Grammar Forms	1981/08/01	English
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem	1994/08/01	English
A Note on Merging	1972/06/01	English
The Joint Distribution of Elastic Buckets in Multiway Search Trees	1994/10/01	English
Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices	1995/02/01	English
Efficiently Planning Compliant Motion in the Plane	1996/06/01	English
A Model for Asynchronous Shared Memory Parallel Computation	1994/12/01	English
Polynomial-Time Membership Comparable Sets	1995/10/01	English
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space	1994/02/01	English
Efficient Algorithms for the Hitchcock Transportation Problem	1995/06/01	English
On Point Location and Motion Planning among Simplices	1996/10/01	English
The Complexity and Distribution of Hard Problems	1995/04/01	English
Some Remarks on p-Way Merging	1977/06/01	English
A Complexity Index for Satisfiability Problems	1994/02/01	English
A Subexponential Algorithm for Abstract Optimization Problems	1995/10/01	English
Complexity of Network Reliability and Optimal Resource Placement Problems	1994/06/01	English
Selecting Heavily Covered Points	1994/12/01	English
Low-Degree Spanning Trees of Small Weight	1996/04/01	English
Alphabet-Independent Two-Dimensional Witness Computation	1996/10/01	English
The Set Union Problem with Unlimited Backtracking	1994/02/01	English