Abstract is missing.
- Direct Bulk-Synchronous Parallel AlgorithmsAlexandros V. Gerbessiotis, Leslie G. Valiant. 1-18
- Memory Limited Inductive Inference MachinesRusins Freivalds, Carl H. Smith. 19-29
- Retrieval of scattered information by EREW, CREW and CRCW PRAMsFaith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde. 30-41
- On Small Depth Threshold CircuitsAlexander A. Razborov. 42-52
- An Elementary Approach to Some Analytic AsymptoticsNicholas Pippenger. 53-61
- An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix MultiplicationsArtur Czumaj. 62-72
- Generating Sparse 2-spannersGuy Kortsarz, David Peleg. 73-82
- Low-Diameter Graph Decomposition is in NCBaruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg. 83-93
- Parallel Algorithm for Cograph Recognition with ApplicationsXin He. 94-105
- Parallel Algorithms for All Minimum Link Paths and Link Center ProblemsSubir Kumar Ghosh, Anil Maheshwari. 106-117
- Optimal Multi-Packet Routing on the TorusMichael Kaufmann, Jop F. Sibeyn. 118-129
- Parallel Algorithms for Priority Queue OperationsMaria Cristina Pinotti, Geppino Pucci. 130-139
- Heap Construction in the Parallel Comparison Tree ModelPaul F. Dietz. 140-150
- Efficient Rebalancing of Chromatic Search TreesJoan Boyar, Kim S. Larsen. 151-164
- The Complexity of Scheduling Problems with Communication Delays for TreesAndreas Jakoby, Rüdiger Reischuk. 165-177
- The List Update Problem and the Retrieval of SetsFabrizio d Amore, Vincenzo Liberatore. 178-191
- GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe ReorganizationWalter Cunto, Vicente Yriarte. 192-211
- Fractional Cascading SimplifiedSandeep Sen. 212-220
- Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version)Dora Giammarresi, Giuseppe F. Italiano. 221-232
- Fully Dynamic 2-Edge-Connectivity in Planar GraphsJohn Hershberger, Monika Rauch, Subhash Suri. 233-244
- Non-Interfering Network FlowsColin McDiarmid, Bruce A. Reed, Alexander Schrijver, B. Shepherd. 245-257
- Triangulating Planar Graphs While Minimizing the Maximum DegreeGoos Kant, Hans Leo Bodlaender. 258-271
- How to Draw a Series-Parallel Digraph (Extended Abstract)Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis. 272-283
- Coloring Random GraphsMartin Fürer, C. R. Subramanian. 284-291
- Testing Superperfection of k-TreesTon Kloks, Hans L. Bodlaender. 292-303
- Parametric Problems on Graphs of Bounded Tree-WidthDavid Fernández-Baca, Giora Slutzki. 304-316
- Efficient Two-dimensional SearchingGaston H. Gonnet. 317
- Improvements on Geometric Pattern Matching ProblemsL. Paul Chew, Klara Kedem. 318-325
- Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval GraphsDeborah Joseph, Joao Meidanis, Prasoon Tiwari. 326-337
- New Results on Linear Programming and Related ProblemsEmo Welzl. 338-339
- Dynamic Closest Pairs - A Probabilistic ApproachMordecai J. Golin. 340-351
- Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract)Mark de Berg, Marc J. van Kreveld, Jack Snoeyink. 352-363
- Decomposing the Boundary of a Nonconvex PolyhedronBernard Chazelle, Leonidas Palios. 364-375
- Convex Polygons Made from Few Lines and Convex Decompositions of PolyhedraJohn Hershberger, Jack Snoeyink. 376-387
- Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at InfinityHans-Peter Lenhof, Michiel H. M. Smid. 388-398
- Voronoi Diagrams of Moving Points in Higher Dimensional SpacesGerhard Albers, Thomas Roos. 399-409
- Sorting Multisets Stably in Minimum SpaceJyrki Katajainen, Tomi Pasanen. 410-421
- A Framework for Adaptive SortingOla Petersson, Alistair Moffat. 422-433