IP over connection-oriented networks and distributional paging (PDF)
On-line admission control and circuit routing for high performance computing and communication (PDF)
A theory of competitive analysis for distributed algorithms (PDF)
Beyond competitive analysis [on-line algorithms] (PDF)
Program result-checking: a theory of testing meets a test of theory (PDF)
Fast and feasible periodic sorting networks of constant depth (PDF)
Scheduling multithreaded computations by work stealing (PDF)
Nearly tight bounds for wormhole routing (PDF)
On the design of reliable Boolean circuits that contain partially unreliable gates (PDF)
Products and help bits in decision trees (PDF)
Efficient oblivious branching programs for threshold functions (PDF)
A lower bound for the monotone depth of connectivity (PDF)
On the robustness of functional equations (PDF)
Randomness-efficient oblivious sampling (PDF)
Computing with very weak random sources (PDF)
(De)randomized construction of small sample spaces in /spl Nscr//spl Cscr/ (PDF)
Fast and lean self-stabilizing asynchronous protocols (PDF)
The load, capacity and availability of quorum systems (PDF)
Rapid rumor ramification: approximating the minimum broadcast time (PDF)
Estimating the size of the transitive closure in linear time (PDF)
Maximum (s,t)-flows in planar networks in O(|V|log|V|) time (PDF)
Long tours and short superstrings (PDF)
Finding the k shortest paths (PDF)
Efficient average-case algorithms for the modular group (PDF)
The complexity of the membership problem for 2-generated commutative semigroups of rational matrices (PDF)
Algorithms for quantum computation: discrete logarithms and factoring (PDF)
On the power of quantum computation (PDF)
Algorithmic number theory-the complexity contribution (PDF)
The power of team exploration: two robots can learn unlabeled directed graphs (PDF)
PAC learning with irrelevant attributes (PDF)
On learning discretized geometric concepts (PDF)
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (PDF)
A note on the /spl theta/ number of Lovasz and the generalized Delsarte bound (PDF)
Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs (PDF)
Finding separator cuts in planar graphs within twice the optimal (PDF)
Approximate graph coloring by semidefinite programming (PDF)
On rank vs. communication complexity (PDF)
On syntactic versus computational views of approximability (PDF)
Measure on small complexity classes, with applications for BPP (PDF)
Lower bounds on Hilbert's Nullstellensatz and propositional proofs (PDF)
Optimal evolutionary tree comparison by sparse dynamic programming (PDF)
Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms (PDF)
Fully dynamic cycle-equivalence in graphs (PDF)
Optimizing static calendar queues (PDF)
A new efficient radix sort (PDF)
Randomized and deterministic algorithms for geometric spanners of small diameter (PDF)
More output-sensitive geometric algorithms (PDF)
Parallel algorithms for higher-dimensional convex hulls (PDF)
A spectral approach to lower bounds (PDF)
Markov chains and polynomial time algorithms (PDF)
Set constraints with projections are in NEXPTIME (PDF)
On the combinatorial and algebraic complexity of quantifier elimination (PDF)
A polynomial-time algorithm for deciding equivalence of normed context-free processes (PDF)
Graph connectivity and monadic NP (PDF)
Priority encoding transmission (PDF)
Tail bounds for occupancy and the satisfiability threshold conjecture (PDF)
The geometry of graphs and some of its algorithmic applications (PDF)
Expander codes (PDF)
On the computation of Boolean functions by analog circuits of bounded fan-in (PDF)
Complexity lower bounds for computation trees with elementary transcendental function gates (PDF)
An O(n/sup 1+/spl epsiv// log b) algorithm for the complex roots problem (PDF)
Algebraic computation trees in characteristic p>0 (PDF)
The localization problem for mobile robots (PDF)
Motion planning on a graph (PDF)
Randomized simplex algorithms on Klee-Minty cubes (PDF)
"Go with the winners" algorithms (PDF)
Reducibility and completeness in multi-party private computations (PDF)
On the complexity of bounded-interaction and noninteractive zero-knowledge proofs (PDF)
On monotone formula closure of SZK (PDF)
