Abstract is missing.
- High Performance Transaction Systems on the SB-PRAMG. Gemünd, M. Jakob, Werner Massonne, Wolfgang J. Paul, B. Spengler. 1-10
- Improved Optimal Shared Memory Simulations, and the Power of ReconfigurationArtur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann. 11-19
- Randomized Single-Target Hot-Potato RoutingIshai Ben-Aroya, Ilan Newman, Assaf Schuster. 20-29
- Observations on Hot Potato RoutingUriel Feige. 30-39
- NP-sets are Co-NP-immune Relative to a Random OracleNikolai K. Vereshchagin. 40-45
- Lower Bounds for Perceptrons Solving some Separation Problems and Oracle Separation of AM from PPNikolai K. Vereshchagin. 46-51
- A Lower Bound on the Mod 6 Degree of the OR FunctionGábor Tardos, David A. Mix Barrington. 52-56
- A General Technique for Implementation of Efficient Priority QueuesPeter Høyer. 57-66
- All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in StringsJeanette P. Schmidt. 67-77
- Improved Algorithms in Geometric Optimization via ExpandersMatthew J. Katz. 78-87
- Finding percentile elementsDorit Dor, Uri Zwick. 88-97
- Public Data Structures: Counters as a Special Case (Abridged Version)Hagit Brit, Shlomo Moran, Gadi Taubenfeld. 98-110
- Dynamic CountingAmir Ben-Dor, Amos Israeli, Asaf Shirazi. 111-120
- Towards A Practical Snapshot AlgorithmYaron Riany, Nir Shavit, Dan Touitou. 121-129
- A Partial Order Approach to Branching Time Logic Model CheckingRob Gerth, Ruurd Kuiper, Doron Peled, Wojciech Penczek. 130-139
- More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci ProgramsDavid Harel, Eli Singerman. 140-149
- Automata with Sensing HeadsH. Petersen. 150-157
- Open Combinatorial Problems in Computational Molecular BiologyPavel A. Pevzner, Michael S. Waterman. 158-173
- Computation of Highly Regular Nearby PointsCarsten Rössner, Claus-Peter Schnorr. 174-181
- Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUTUriel Feige, Michel X. Goemans. 182-189
- Some Improvements to Total Degree TestsKatalin Friedl, Madhu Sudan. 190-198
- Computational Pseudo-RandomnessAvi Wigderson. 218-219
- Optimal deterministic approximate parallel prefix sums and their applicationsTal Goldberg, Uri Zwick. 220-228
- On the Power of Randomization for the Common PRAMOmer Berkman, Phillip B. Gibbons, Yossi Matias. 229-240
- Randomized On-Line Scheduling of Parallel JobsJiri Sgall. 241-250
- Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous ComputationsShlomo Moran. 251-257
- Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report)Jon M. Kleinberg, Hagit Attiya, Nancy A. Lynch. 258-267
- Local Computations on Static and Dynamic Graphs (Preliminary Version)Alain J. Mayer, Moni Naor, Larry J. Stockmeyer. 268-278