Beyond the flow decomposition barrier (Abstract)
A Faster Deterministic Algorithm for Minimum Spanning Trees (Abstract)
Flows in undirected unit capacity networks (Abstract)
Randomized and deterministic algorithms for the dimension of algebraic varieties (Abstract)
Deciding properties of polynomials without factoring (Abstract)
An Improved Algorithm for Quantifier Elimination Over Real Closed Fields (Abstract)
On the power of quantum finite state automata (Abstract)
Two Decades of Temporal Logic: Achievements and Challenges (PDF)
Computable obstructions to wait-free computability (Abstract)
Reliable cellular automata with self-organization (Abstract)
Alternating-time Temporal Logic (Abstract)
On the Complexity of a Set-Union Problem (Abstract)
Succinct representation of balanced parentheses, static trees and planar graphs (Abstract)
Deterministic Superimposed Coding with Applications to Pattern Matching (Abstract)
Optimal suffix tree construction with large alphabets (Abstract)
Pattern matching with swaps (Abstract)
Improved bounds on planar k-sets and k-levels (Abstract)
Computing integral points in convex semi-algebraic sets (Abstract)
The Computational Complexity of Knot and Link Problems (Abstract)
Approximating Shortest Paths on a Nonconvex Polyhedron (Abstract)
Randomized Allocation Processes (Abstract)
The analysis of a list-coloring algorithm on a random graph (Abstract)
Contention Resolution with Guaranteed Constant Expected Delay (Abstract)
Path coupling: A technique for proving rapid mixing in Markov chains (Abstract)
Separation of the monotone NC hierarchy (Abstract)
Making nondeterminism unambiguous (Abstract)
No feasible interpolation for TC/sup 0/-Frege proofs (Abstract)
Weak random sources, hitting sets, and BPP simulations (Abstract)
Parallelizing Elimination Orders with Linear Fill (Abstract)
Exploiting Locality for Data Management in Systems of Limited Bandwidth (Abstract)
General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) (Abstract)
Global Optimization Using Local Information with Applications to Flow Control (Abstract)
Truly online paging with locality of reference (Abstract)
The Competitive Analysis of Risk Taking with Applications to Online Trading (Abstract)
Minimizing flow time nonclairvoyantly (Abstract)
Storage Management for Evolving Databases (Abstract)
Replication is not needed: single database, computationally-private information retrieval (Abstract)
Does Parallel Repetition Lower the Error in Computationally Sound Protocols? (Abstract)
Optimal-resilience proactive public-key cryptosystems (Abstract)
A Concrete Security Treatment of Symmetric Encryption (Abstract)
A 7/8-Approximation Algorithm for MAX 3SAT? (Abstract)
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems (Abstract)
Improved Approximation Algorithms for Unsplittable Flow Problems (Abstract)
Lower bounds for the signature size of incremental schemes (Abstract)
A Complete Promise Problem for Statistical Zero-Knowledge (Abstract)
Number-theoretic constructions of efficient pseudo-random functions (Abstract)
An Improved Worst-Case to Average-Case Connection for Lattice Problems (Abstract)
Finding an Even Hole in a Graph (Abstract)
Edge-Connectivity Augmentation Preserving Simplicity (Abstract)
Hamiltonian Cycles in Solid Grid Graphs (Abstract)
A Random Sampling based Algorithm for Learning the Intersection of Half-spaces (Abstract)
Learning noisy perceptrons by a perceptron in polynomial time (Abstract)
Nearly tight bounds on the learnability of evolution (Abstract)
Improved approximations for shallow-light spanning trees (Abstract)
Buy-at-bulk network design (Abstract)
A 2-approximation algorithm for the directed multiway cut problem (Abstract)
Satisfiability Coding Lemma (Abstract)
The Minimization Problem for Boolean Formulas (Abstract)
Tight bounds for depth-two superconcentrators (Abstract)
Constant depth circuits and the Lutz hypothesis (Abstract)