Abstract is missing.
- Fast Deterministic Processor AllocationTorben Hagerup. 1-10
- Finding Connected Components in O(log n log log n) Time on the EREW PRAMKa Wong Chong, Tak Wah Lam. 11-20
- Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut AlgorithmDavid R. Karger. 21-30
- A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar MapsYi-Jen Chiang, Franco P. Preparata, Roberto Tamassia. 44-53
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a WalkJohn Hershberger, Subhash Suri. 54-63
- Iterated Nearest Neighbors and Finding Minimal PolytopesDavid Eppstein, Jeff Erickson. 64-73
- Efficient Randomized Algorithms for the Repeated Median Line EstimatorJirí Matousek, David M. Mount, Nathan S. Netanyahu. 74-82
- A New and Simple Algorithm for Quality 2-Dimensional Mesh GenerationJim Ruppert. 83-92
- Polygonal Approximations that Minimize the Number of InflectionsJohn D. Hobby. 93-102
- Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding TechniquesNaveen Garg, Santosh Vempala, Aman Singla. 103-111
- The Vertex-Disjoint Menger Problem in Planar GraphsHeike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe. 112-119
- Triangulating Vertex Colored GraphsFred R. McMorris, Tandy Warnow, Thomas Wimer. 120-127
- An O(n²) Algorithm for Circular-Arc Graph RecognitionElaine M. Eschen, Jeremy Spinrad. 128-137
- Optimal Edge Ranking of Trees in Polynomial TimePilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer. 138-144
- Data Structures for Traveling SalesmenMichael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer. 145-154
- Confluently Persistent Deques via Data Structural BootstrappingAdam L. Buchsbaum, Robert Endre Tarjan. 155-164
- Scapegoat TreesIgal Galperin, Ronald L. Rivest. 165-174
- A Data Structure for Dynamically Maintaining Rooted TreesGreg N. Frederickson. 175-184
- Upper and Lower Bounds on Constructing Alphabetic Binary TreesMaria M. Klawe, Brendan Mumey. 185-193
- Lower Bounds for Set Intersection QueriesPaul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig. 194-201
- A Representation for Crossing Set Families with Applications to Submodular Flow ProblemsHarold N. Gabow. 202-211
- Finding Near-Optimal Cuts: An Empirical EvaluationKevin Lang, Satish Rao. 212-221
- Scaling Algorithms for the Shortest Paths ProblemAndrew V. Goldberg. 222-231
- Solving Mixed 0-1 Programs by a Lift-and-Project MethodEgon Balas, Sebastián Ceria, Gérard Cornuéjols. 232-242
- Balancing Minimum Spanning and Shortest Path TreesSamir Khuller, Balaji Raghavachari, Neal E. Young. 243-250
- Approximate Nearest Neighbor Queries in Fixed DimensionsSunil Arya, David M. Mount. 271-280
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed DimensionsBernard Chazelle, Jirí Matousek. 281-290
- Faster Algorithms for Some Geometric Graph Problems in Higher DimensionsPaul B. Callahan, S. Rao Kosaraju. 291-300
- Data Structures and Algorithms for Nearest Neighbor Search in General Metric SpacesPeter N. Yianilos. 311-321
- On the Satisfiability and Maximum Satisfiability of Random 3-CNF FormulasAndrei Z. Broder, Alan M. Frieze, Eli Upfal. 322-330
- Chernoff-Hoeffding Bounds for Applications with Limited IndependenceJeanette P. Schmidt, Alan Siegel, Aravind Srinivasan. 331-340
- Analysis of a Simple Greedy Matching Algorithm on Random Cubic GraphsAlan M. Frieze, A. J. Radcliffe, Stephen Suen. 341-351
- Maxima in Convex RegionsMordecai J. Golin. 352-360
- Dynamic Generation of Discrete Random VariatesYossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni. 361-370
- Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular BiologyFarid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser. 371-381
- Improved Dynamic Dictionary MatchingAmihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer. 392-401
- The Suffix of a Square Matrix, with ApplicationsRaffaele Giancarlo. 402-411
- On Traversing Layered Graphs On-lineH. Ramesh. 412-421
- Non-Clairvoyant SchedulingRajeev Motwani, Steven J. Phillips, Eric Torng. 422-431
- On-line Choice of On-line AlgorithmsYossi Azar, Andrei Z. Broder, Mark S. Manasse. 432-440
- Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path ProblemMing-Yang Kao, John H. Reif, Stephen R. Tate. 441-447
- Scheduling Unrelated Machines with CostsDavid B. Shmoys, Éva Tardos. 448-454
- Competitive Implementation of Parallel ProgramsXiaotie Deng, Elias Koutsoupias. 455-461
- Equidistribution of Point Sets for the Traveling Salesman and Related Problems462-466
- Optimistic Sorting and Information Theoretic ComplexityPeter M. McIlroy. 467-474
- An Efficient Protocol for Unconditionally Secure Secret Key ExchangeMichael J. Fischer, Rebecca N. Wright. 475-483
- Polynomial Algorithms for Minimum Cost Paths in Periodic GraphsFranz Höfting, Egon Wanke. 493-499
- A Linear Time 2+epsilon Approximation Algorithm for Edge ConnectivityDavid W. Matula. 500-504