Witnesses for Boolean matrix multiplication and for shortest paths (PDF)
Towards a computational theory of statistical tests (PDF)
On minimum and maximum spanning trees of linearly moving points (PDF)
Safe and effective determinant evaluation (PDF)
Enumerating the k closest pairs optimally (PDF)
On the completeness of object-creating query languages (PDF)
Efficient inference of partial types (PDF)
Undecidability of the Horn-clause implication problem (PDF)
The distributed k-server problem-a competitive distributed translator for k-server algorithms (PDF)
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (PDF)
A mildly exponential approximation algorithm for the permanent (PDF)
On the bit extraction problem (PDF)
Quadratic dynamical systems (PDF)
On the second eigenvalue and linear expansion of regular graphs (PDF)
Lower bounds on the depth of monotone arithmetic computations (PDF)
Separating the communication complexities of MOD m and MOD p circuits (PDF)
Algebraic decision trees and Euler characteristics (PDF)
Amplification and percolation (probabilistic Boolean functions) (PDF)
Truly alphabet-independent two-dimensional pattern matching (PDF)
The asymptotic complexity of merging networks (PDF)
Improved lower bounds for Shellsort (PDF)
On-line load balancing (PDF)
A decomposition theorem and bounds for randomized server problems (PDF)
The complexity of the Hajos calculus (PDF)
Back to the future: towards a theory of timed regular languages (PDF)
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (PDF)
Fault-tolerant wait-free shared objects (PDF)
Clock construction in fully asynchronous parallel systems and PRAM simulation (PDF)
Communication on noisy channels: a coding theorem for computation (PDF)
Fault tolerant graphs, perfect hash functions and disjoint paths (PDF)
Maximizing non-linear concave functions in fixed dimension (PDF)
A class of logic problems solvable by linear programming (PDF)
Newton's method for fractional combinatorial optimization (PDF)
Approximate max flow on small depth networks (PDF)
The complexity of parallel prefix problems on small domains (PDF)
Waste makes haste: tight bounds for loose parallel sorting (PDF)
Mick gets some (the odds are on his side) (satisfiability) (PDF)
Tighter bounds on the exact complexity of string matching (PDF)
Optimal parallel hull construction for simple polygons in O(log log n) time (PDF)
Efficient minimum cost matching using quadrangle inequality (PDF)
Computing a shortest k-link path in a polygon (PDF)
A theory of wormhole routing in parallel computers (PDF)
Exact analysis of hot-potato routing (PDF)
On the fault tolerance of some popular bounded-degree networks (PDF)
Efficient self-embedding of butterfly networks with random faults (PDF)
Read-thrice DNF is hard to learn with membership and equivalence queries (PDF)
On the exact learning of formulas in parallel (PDF)
Reconstructing algebraic functions from mixed data (PDF)
Apple tasting and nearly one-sided learning (PDF)
On the randomized complexity of volume and diameter (PDF)
The algorithmic aspects of the regularity lemma (PDF)
A subexponential algorithm for abstract optimization problems (PDF)
On efficient band matrix arithmetic (PDF)
How to denest Ramanujan's nested radicals (PDF)
Fast unimodular reduction: planar integer lattices (PDF)
Zero-knowledge proofs of knowledge without interaction (PDF)
Randomized consensus in expected O(n log/sup 2/ n) operations per processor (PDF)
Improved parallel polynomial division and its extensions (PDF)
Fast algorithms for matrix normal forms (PDF)
Computing in solvable matrix groups (PDF)
Randomized geometric algorithms and pseudo-random generators (PDF)
Dynamic half-space reporting, geometric optimization, and minimum spanning trees (PDF)
On four-connecting a triconnected graph (PDF)
Sparsification-a technique for speeding up dynamic graph algorithms (PDF)
Fully dynamic biconnectivity in graphs (PDF)
The isomorphism conjecture holds relative to an oracle (PDF)
Undirected connectivity in O(log/sup 1.5/n) space (PDF)
Proof verification and hardness of approximation problems (PDF)
Probabilistic checking of proofs; a new characterization of NP (PDF)
