Abstract is missing.
- Efficient Text Searching of Regular ExpressionsRicardo A. Baeza-Yates, Gaston H. Gonnet. 1-2
- Efficient Spatial Point Location (Extended Abstract)Franco P. Preparata, Roberto Tamassia. 3-11
- Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version)Michael T. Goodrich, Colm Ó Dúnlaing, Chee-Keng Yap. 12-23
- Analysis of KDT-Trees: KD-Trees Improved by Local ReogranisationsWalter Cunto, Gustavo Lau, Philippe Flajolet. 24-38
- Optimal Algorithms for List Indexing and Subset RankPaul F. Dietz. 39-46
- The Delauney Triangulation Closely Approximates the Complete Euclidean GraphJ. Mark Keil, Carl A. Gutwin. 47-56
- Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report)David Rappaport. 57-66
- Fully Persistent Arrays (Extended Array)Paul F. Dietz. 67-74
- String Searching Algorithms RevisitedRicardo A. Baeza-Yates. 75-96
- Optimal Channel Placement for Multi-Terminal NetsMikhail J. Atallah, Susanne E. Hambrusch. 97-114
- Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version)Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri. 115-134
- Computing the Kernel of a Point Set in a Polygon (Extended Abstract)Yan Ke, Joseph O Rourke. 135-146
- Using Bounded Degree Spanning Trees in the Design of Efficient Algorihtms on Claw-Free GraphsMarek Chrobak, Joseph Naor, Mark B. Novick. 147-162
- Linear Time Algorithms for Computing Reachability Regions from Polygonal FiguresRongyao Zhao. 163-170
- Computing the Center of Area of a PolygonMatthew Díaz, Joseph O Rourke. 171-182
- Weighted Orthogonal Linear L:::/infty:::-Approximation and ApplicationsMichael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert. 183-193
- Discs and Other Related Data StructuresFabrizio Luccio, Mireille Régnier, René Schott. 192-205
- Digital Data Structures and Order StatisticsWojciech Szpankowski. 206-217
- On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained TreesDanièle Gardy, Philippe Flajolet, Claude Puech. 218-229
- Probabilistic Analysis of Algorithms and Data StructuresLuc Devroye. 230
- Stabbing Parallel Segments with a Convex Polygon (Extended Abstract)Michael T. Goodrich, Jack Snoeyink. 231-242
- Selecting the kth Largest-Area Convex PolygonJeffrey S. Salowe. 243-250
- Finding All Shortest Path Edge Sequences on a Convex PolyhedronYie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu. 251-266
- Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc GraphA. Srinivasa Rao, C. Pandu Rangan. 267-290
- NC Algorithms for Circular-Arc GraphsLin Chen. 291-302
- Parallel Algorithms for the Subgraph Homeomorphism ProblemSamir Khuller. 303-315
- Galleries, Light Matchings and Visibility GraphsJurek Czyzowicz, Ivan Rival, Jorge Urrutia. 316-324
- Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract)David G. Kirkpatrick, Stephen K. Wismath. 325-334
- Parallel Algorithms for Cographs Recognition and ApplicationsGur Saran Adhar, Shietung Peng. 335-351
- Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version)Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. 352-372
- Motion Planning in the CL-Environment (Extended Abstract)Chee-Keng Yap, Helmut Alt. 373-380
- Self-Adjusting k-ary Search TreesMurray Sherk. 381-392
- Improving Partial Rebuilding by Using Simple Balance CriteriaArne Andersson. 393-402
- An Efficient All-Parses Systolic Algorithm for General Context-Free ParsingOscar H. Ibarra, Michael A. Palis. 403-419
- A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite AutomataSam M. Kim, Robert McNaughton, Robert McCloskey. 420-436
- Skip Lists: A Probabilistic Alternative to Balanced TreesWilliam Pugh. 437-449
- A Fast Algorithm for Melding Splay TreesGraeme Port, Alistair Moffat. 450-459
- An Efficient Algorithm for Finding all Maximal Square Blocks in a MatrixHeinz Breu. 460-471
- Complexity Issues in Tree-Based Version ControlNaomi Nishimura. 472-486
- Structured NCBertha Scholten, Jan van Leeuwen. 487-498
- Heapsort - Adapted for Presorted FilesChristos Levcopoulos, Ola Petersson. 499-509
- The Distribution of Keys in a Binary HeapMark Allen Weiss, Jainendra K. Navlakha. 510-516
- Optimal Hypercube Algorithms for Labeled Images (Preliminary Version)Russ Miller, Quentin F. Stout. 517-528
- On the Complexity of Single Row Routing ProblemsAdair Dingle, Ivan Hal Sudborough. 529-540
- A New Search Time Update Time Tradeoff for the Implicit DictionaryPhilippe Derome. 541-551
- Sorting with Minimum Data Movement (Preliminary Draft)J. Ian Munro, Venkatesh Raman. 552-562
- Augmentation Problems on Hierarchically Defined Graphs (Preliminary Version)David Fernández-Baca, Mark A. Williams. 563-576
- On Linear Time Minor Tests and Depth First SearchHans Leo Bodlaender. 577-590
- Combinatorial and Computational Results for Line Arrangements in SpaceHerbert Edelsbrunner. 591