Abstract is missing.
- Beyond the Flow Decomposition BarrierAndrew V. Goldberg, Satish Rao. 2-11 [doi]
- A Faster Deterministic Algorithm for Minimum Spanning TreesBernard Chazelle. 22-31 [doi]
- Flows in Undirected Unit Capacity NetworksAndrew V. Goldberg, Satish Rao. 32-34 [doi]
- Randomized and Deterministic Algorithms for the Dimension of Algebraic VarietiesPascal Koiran. 36-45 [doi]
- Deciding Properties of Polynomials Without FactoringTomas Sander, Mohammad Amin Shokrollahi. 46-55 [doi]
- An Improved Algorithm for Quantifier Elimination Over Real Closed FieldsSaugata Basu. 56-65 [doi]
- On the Power of Quantum Finite State AutomataAttila Kondacs, John Watrous. 66-75 [doi]
- Two Decades of Temporal Logic: Achievements and Challenges (Abstract)Amir Pnueli. 78 [doi]
- Computable Obstructions to Wait-free ComputabilityJohn Havlicek. 80-89 [doi]
- Alternating-time Temporal LogicRajeev Alur, Thomas A. Henzinger, Orna Kupferman. 100-109 [doi]
- On the Complexity of a Set-Union ProblemRichard J. Lipton, Paul J. Martino, Andy Neitzke. 110-115 [doi]
- Succinct Representation of Balanced Parentheses, Static Trees and Planar GraphsJ. Ian Munro, Venkatesh Raman. 118-126 [doi]
- Deterministic Superimposed Coding with Applications to Pattern MatchingPiotr Indyk. 127-136 [doi]
- Optimal Suffix Tree Construction with Large AlphabetsMartin Farach. 137-143 [doi]
- Pattern Matching with SwapsAmihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein. 144-153 [doi]
- Improved Bounds on Planar k-sets and k-levelsTamal K. Dey. 165-161 [doi]
- The Computational Complexity of Knot and Link ProblemsJoel Hass, J. C. Lagarias, Nicholas Pippenger. 172-181 [doi]
- Approximating Shortest Paths on an Nonconvex PolyhedronKasturi R. Varadarajan, Pankaj K. Agarwal. 182-191 [doi]
- Randomized Allocation ProcessesArtur Czumaj, Volker Stemann. 194-203 [doi]
- The Analysis of a List-Coloring Algorithm on a Random GraphDimitris Achlioptas, Michael S. O. Molloy. 204-212 [doi]
- Contention Resolution with Guaranteed Constant Expected DelayLeslie Ann Goldberg, Philip D. MacKenzie. 213-222 [doi]
- Path Coupling: A Technique for Proving Rapid Mixing in Markov ChainsRuss Bubley, Martin E. Dyer. 223-231 [doi]
- Separation of the Monotone NC HierarchyRan Raz, Pierre McKenzie. 234-243 [doi]
- Making Nondeterminism UnambiguousKlaus Reinhardt, Eric Allender. 244-253 [doi]
- No Feasible Interpolation for TC0-Frege ProofsMaria Luisa Bonet, Toniann Pitassi, Ran Raz. 254-263 [doi]
- Weak Random Sources, Hitting Sets, and BPP SimulationsAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan. 264-272 [doi]
- Parallelizing Elimination Orders with Linear FillClaudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi. 274-283 [doi]
- Exploiting Locality for Data Management in Systems of Limited BandwidthBruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann. 284-293 [doi]
- General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang. 294-302 [doi]
- Global Optimization Using Local Information with Applications to Flow ControlYair Bartal, John W. Byers, Danny Raz. 303-312 [doi]
- New Directions in Cryptography: Twenty Some Years LaterShafi Goldwasser. 314-324 [doi]
- Truly Online Paging with Locality of ReferenceAmos Fiat, Manor Mendel. 326-335 [doi]
- Storage Management for Evolving DatabasesJon M. Kleinberg, Rajeev Motwani, Prabhakar Raghavan, Suresh Venkatasubramanian. 353-362 [doi]
- Does Parallel Repetition Lower the Error in Computationally Sound Protocols?Mihir Bellare, Russell Impagliazzo, Moni Naor. 374-383 [doi]
- Optimal Resilience Proactive Public-Key CryptosystemsYair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung. 384-393 [doi]
- A Concrete Security Treatment of Symmetric EncryptionMihir Bellare, Anand Desai, E. Jokipii, Phillip Rogaway. 394-403 [doi]
- A 7/8-Approximation Algorithm for MAX 3SAT?Howard J. Karloff, Uri Zwick. 406-415 [doi]
- Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing ProblemsAravind Srinivasan. 416-425 [doi]
- Lower Bounds for the Signature Size of Incremental SchemesMarc Fischlin. 438-447 [doi]
- A Complete Promise Problem for Statistical Zero-KnowledgeAmit Sahai, Salil P. Vadhan. 448-457 [doi]
- Number-theoretic Constructions of Efficient Pseudo-random FunctionsMoni Naor, Omer Reingold. 458-467 [doi]
- An Improved Worst-Case to Average-Case Connection for Lattice ProblemsJin-yi Cai, Ajay Nerurkar. 468-477 [doi]
- Finding an Even Hole in a GraphMichele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic. 480-485 [doi]
- Edge-Connectivity Augmentation Preserving SimplicityJørgen Bang-Jensen, Tibor Jordán. 486-495 [doi]
- Hamiltonian Cycles in Solid Grid GraphsChristopher Umans, William Lenhart. 496-505 [doi]
- Learning Noisy Perceptrons by a Perceptron in Polynomial TimeEdith Cohen. 514-523 [doi]
- Nearly Tight Bounds on the Learnability of EvolutionAndris Ambainis, Richard Desper, Martin Farach, Sampath Kannan. 524-533 [doi]
- Improved Approximations for Shallow-Light Spanning TreesJoseph Naor, Baruch Schieber. 536-541 [doi]
- A 2-Approximation Algorithm for the Directed Multiway Cut ProblemJoseph Naor, Leonid Zosin. 548-553 [doi]
- Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric ProblemsSanjeev Arora. 554-563 [doi]
- Satisfiability Coding LemmaRamamohan Paturi, Pavel Pudlák, Francis Zane. 566-574 [doi]
- The Minimization Problem for Boolean FormulasEdith Hemaspaandra, Gerd Wechsung. 575-584 [doi]
- Tight Bounds for Depth-two SuperconcentratorsJaikumar Radhakrishnan, Amnon Ta-Shma. 585-594 [doi]
- Constant Depth Circuits and the Lutz HypothesisJin-yi Cai, D. Sivakumar, Martin Strauss. 595-604 [doi]