Abstract is missing.
- BLASTING through the Information Theoretic Barrier with FUSION TREESMichael L. Fredman, Dan E. Willard. 1-7
- On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract)Richard Cole. 8-17
- Unique Binary Search Tree Representations and Equality-testing of Sets and SequencesRajamani Sundar, Robert Endre Tarjan. 18-25
- The Information Theory Bound Is Tight for Selection in a HeapGreg N. Frederickson. 26-33
- Lower Bounds for the Union-Find and the Split-Find Problem on Pointer MachinesJohannes A. La Poutré. 34-44
- Optimal Randomized Algorithms for Local Sorting and Set-MaximaWayne Goddard, Valerie King, Leonard J. Schulman. 45-53
- On the Necessity of Occam AlgorithmsRaymond A. Board, Leonard Pitt. 54-63
- Learning Boolean Functions in an Infinite Atribute Space (Extended Abstract)Avrim Blum. 64-72
- Self-Testing/Correcting with Applications to Numerical ProblemsManuel Blum, Michael Luby, Ronitt Rubinfeld. 73-83
- Coherent Functions and Program Checkers (Extended Abstract)Andrew Chi-Chih Yao. 84-94
- The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract)Shimon Even, Sergio Rajsbaum. 95-105
- The Wakeup Problem (Extended Abstract)Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld. 106-116
- How to Distribute a Dictionary in a Complete NetworkMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. 117-127
- Computing with Unreliable Information (Preliminary Version)Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal. 128-137
- Efficient Robust Parallel Computations (Extended Abstract)Zvi M. Kedem, Krishna V. Palem, Paul G. Spirakis. 138-148
- On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract)Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs. 149-158
- Optimal Disk I/O with Parallel Block Transfer (Extended Abstract)Jeffrey Scott Vitter, Elizabeth A. M. Shriver. 159-169
- Deterministic Sampling-A New Technique for Fast Pattern MatchingUzi Vishkin. 170-180
- Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar DigraphsMing-Yang Kao, Philip N. Klein. 181-192
- Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related ComputersRobert Cypher, C. Greg Plaxton. 193-203
- Psuedorandom Generators for Space-Bounded ComputationNoam Nisan. 204-212
- Small-bias Probability Spaces: Efficient Constructions and ApplicationsJoseph Naor, Moni Naor. 213-223
- The Analysis of Closed Hashing under Limited Randomness (Extended Abstract)Jeanette P. Schmidt, Alan Siegel. 224-234
- The Computational Complexity of Universal HashingYishay Mansour, Noam Nisan, Prasoon Tiwari. 235-243
- Not All Keys Can Be Hashed in Constant Time (Preliminary Version)Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson. 244-253
- A Technique for Lower Bounding the Cover TimeDavid Zuckerman. 254-259
- Approximate Inclusion-ExclusionNathan Linial, Noam Nisan. 260-270
- Towards Optimal Simulations of Formulas by Bounded-Width ProgramsRichard Cleve. 271-277
- Functions with Bounded Symmetric Communication Complexity and Circuits with /mathop mod m GatesMario Szegedy. 278-286
- Monotone Circuits for Matching Require Linear DepthRan Raz, Avi Wigderson. 287-292
- A Separator Theorem for Graphs with an Excluded Minor and its ApplicationsNoga Alon, Paul D. Seymour, Robin Thomas. 293-299
- Separators in Two and Three DimensionsGary L. Miller, William P. Thurston. 300-309
- Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform CapacitiesPhilip N. Klein, Clifford Stein, Éva Tardos. 310-321
- Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to kKetan Mulmuley. 322-330
- Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract)Alok Aggarwal, Mark Hansen, Frank Thomson Leighton. 331-340
- Quantitative Steinitz s Theorems with Applications to Multifingered GraspingDavid G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap. 341-351
- An Optimal Algorithm for On-line Bipartite MatchingRichard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani. 352-358
- Online Algorithms for Locating CheckpointsMarshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan. 359-368
- Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir. 369-378
- On the Power of Randomization in Online Algorithms (Extended Abstract)Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson. 379-386
- One-Way Functions are Necessary and Sufficient for Secure SignaturesJohn Rompel. 387-394
- Pseudo-Random Generators under Uniform AssumptionsJohan Håstad. 395-404
- The Discrete Log is Very DiscreetA. W. Schrift, Adi Shamir. 405-415
- Witness Indistinguishable and Witness Hiding ProtocolsUriel Feige, Adi Shamir. 416-426
- Public-key Cryptosystems Provably Secure against Chosen Ciphertext AttacksMoni Naor, Moti Yung. 427-437
- On the Complexity of Local Search (Extended Abstract)Christos H. Papadimitriou, Alejandro A. Schäffer, Mihalis Yannakakis. 438-445
- Quantifiers and Approximation (Extended Abstract)Alessandro Panconesi, Desh Ranjan. 446-456
- On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse SetsMitsunori Ogiwara, Osamu Watanabe. 457-467
- The Undecidability of the Semi-Unification Problem (Preliminary Report)A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn. 468-476
- Decidability of the Multiplicity Equivalence of Multitape Finite AutomataTero Harju, Juhani Karhumäki. 477-481
- Perfect Zero-Knowledge in Constant RoundsMihir Bellare, Silvio Micali, Rafail Ostrovsky. 482-493
- The (True) Complexity of Statistical Zero KnowledgeMihir Bellare, Silvio Micali, Rafail Ostrovsky. 494-502
- The Round Complexity of Secure Protocols (Extended Abstract)Donald Beaver, Silvio Micali, Phillip Rogaway. 503-513
- Efficient Computation on Oblivious RAMsRafail Ostrovsky. 514-523
- Computing in Quotient GroupsWilliam M. Kantor, Eugene M. Luks. 524-534
- On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version)Allan Borodin, Prasoon Tiwari. 535-545
- Searching for Primitive Roots in Finite FieldsVictor Shoup. 546-554
- On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional IdealYagati N. Lakshman. 555-563
- The Number Field SieveArjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard. 564-572