Title	Publication Date	Language	Citations
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain	1994/10/01	English
Prefix Codes: Equiprobable Words, Unequal Letter Costs	1996/12/01	English
Three-dimensional Statistical Data Security Problems	1994/02/01	English
What Can be Computed Locally?	1995/12/01	English
On-Line Algorithms for Path Selection in a Nonblocking Network	1996/06/01	English
Identifying the Minimal Transversals of a Hypergraph and Related Problems	1995/12/01	English
In Memoriam: Eugene L. Lawler	1995/02/01	English
On the Generation of Random Binary Search Trees	1995/12/01	English
Weakly Hard Problems	1995/12/01	English
Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts	1994/06/01	English
Linear Time and Memory-Efficient Computation	1996/02/01	English
Tight Bounds on Oblivious Chaining	1994/12/01	English
Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications	1994/06/01	English
Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems	1994/10/01	English
A Uniform Circuit Lower Bound for the Permanent	1994/10/01	English
On Efficient Simulations of Systolic Arrays by Random-Access Machines	1987/04/01	English
A Heuristic Scheduling of Independent Tasks with Bottleneck Resource Constraints	1995/04/01	English
On-Line Scheduling of Imprecise Computations to Minimize Error	1996/10/01	English
Fixed-Parameter Tractability and Completeness I: Basic Results	1995/08/01	English
Nearly Optimal Algorithms for Canonical Matrix Forms	1995/10/01	English
Robust Characterizations of Polynomials with Applications to Program Testing	1996/04/01	English
Unbounded Speed Variability in Distributed Communications Systems	1985/02/01	English
Corrigendum: A Family of Algorithms for Powering Sparse Polynomials	1980/05/01	English
The Sublogarithmic Alternating Space World	1996/08/01	English
Measure, Stochasticity, and the Density of Hard Languages	1994/08/01	English
Computational Power in Query Languages	1982/08/01	English
Full Abstraction and the Context Lemma	1996/06/01	English
Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima	1994/06/01	English
Packet Transmission in a Noisy-Channel Ring Network	1994/06/01	English
Rectilinear Path Problems among Rectilinear Obstacles Revisited	1995/06/01	English