Abstract is missing.
- Recent Progress in String AlgorithmsZvi Galil. 1
- Selection NetworksNicholas Pippenger. 2-11
- Computing Edge-Connectivity in Multiple and Capacitated GraphsHiroshi Nagamochi, Toshihide Ibaraki. 12-20
- Efficient Sequential and Parallel Algorithms for Planar Minimum Cost FlowHiroshi Imai, Kazuo Iwano. 21-30
- Structural Analyses on the Complexity of Inverting FunctionsOsamu Watanabe, Seinosuke Toda. 31-38
- Oracles versus Proof Techniques that Do Not RelativizeEric Allender. 39-52
- 20-Relative Neighborhood Graphs Are HamiltonianMaw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee. 53-65
- The K-Gabriel Graphs and Their ApplicationsTung-Hsin Su, Ruei-Chuan Chang. 66-75
- Parallel Algorithms for Generating Subsets and Set PartitionsBorivoje Djokic, Masahiro Miyakawa, Satoshi Sekiguchi, Ichiro Semba, Ivan Stojmenovic. 76-85
- Parallel Algorithms for Linked List and BeyondYijie Han. 86-100
- Local Tournaments and Proper Circular Arc GaphsPavol Hell, Jørgen Bang-Jensen, Jing Huang. 101-108
- Fast Algorithms for the Dominating Set Problem on Permutation GraphsKuo-Hui Tsai, Wen-Lian Hsu. 109-117
- Two Probabilistic Results on MergingWenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha. 118-127
- Randomized Broadcast in NetworksUriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal. 128-137
- On the Construction of Abstract Voronoi Diagrams, IIRolf Klein, Kurt Mehlhorn, Stefan Meiser. 138-154
- Searching in Higher DimensionBernard Chazelle. 155
- Finding Extrema with Unary PredicatesDavid G. Kirkpatrick, Feng Gao 0002. 156-164
- Implicitly Searching Convolutions and Computing Depth of CollisionDavid P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. 165-180
- Characterization for a Family of Infinitely Many Irreducible Equally Spaced PolynominalsToshiya Itoh. 181-190
- Distributed Algorithms for DecipheringMichel Cosnard, Jean-Laurent Philippe. 191-200
- An Efficient Algorithm for Optimal Loop ParallelizationKazuo Iwano, Susan Yeh. 201-210
- Another View on the SSS:::*::: AlgorithmWim Pijls, Arie de Bruin. 211-220
- Algorithms from Complexity Theory: Polynominal-Time Operations for Complex SetsLane A. Hemachandra. 221-231
- Complexity Cores and Hard Problem InstancesUwe Schöning. 232-240
- Spatial Point Location and Its ApplicationsXuehou Tan, Tomio Hirata, Yasuyoshi Inagaki. 241-250
- Sublinear Merging and Natural Merge SortSvante Carlsson, Christos Levcopoulos, Ola Petersson. 251-260
- Constructing Strongly Convex Approximate Hulls with Inaccurate PrimitivesLeonidas J. Guibas, David Salesin, Jorge Stolfi. 261-270
- Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial RelaxationKazuo Murota. 271-280
- A Tight Lower Bound on the Size of Planar Permutation NetworksMaria M. Klawe, Frank Thomson Leighton. 281-287
- Simultaneous Solution of Families of ProblemsRefael Hassin. 288-299
- Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to HashingTetsuo Asano, Takeshi Tokuyama. 300-309
- Topological Sweeping in Three DimensionsEfthymios Anagnostou, Vassilios G. Polimenis, Leonidas J. Guibas. 310-317
- Finding Least-Weight Subsequences with Fewer ProcessorsKwong-fai Chan, Tak Wah Lam. 318-327
- Derandomization by Exploiting Redundancy and Mutual IndependenceYijie Han, Yoshihide Igarashi. 328-337
- Planar Separators and the Euclidean NormHillel Gazit, Gary L. Miller. 338-347
- On the Complexity of Isometric Embedding in the HypercubeDavid Avis. 348-357
- Distributed Function Evaluation in the Presence of Transmission FaultsNicola Santoro, Peter Widmayer. 358-367
- Optimal Linear BroadcastSara Bitan, Shmuel Zaks. 368-377
- Graph Augmentation Problems for a Specified Set of VerticesToshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura. 378-387
- A Heuristic Algorithm for the k-Center Problem with Vertex WeightQingzhou Wang, Kam-Hoi Cheng. 388-396
- Parallel Convexity Algorithms for Digitized Images on a Linear Array of ProcessorsHussein M. Alnuweiri, Viktor K. Prasanna. 397-406
- Parallel Algorithms for Labeling Image ComponentsWen-Jing Hsu, Xiaola Lin. 407-418
- A Hyperplane Incidence Problem with Applications to Counting DistancesHerbert Edelsbrunner, Micha Sharir. 419-428
- Splitting a Configuration in a SimplexKazumiti Numata, Takeshi Tokuyama. 429-438
- Weaving Patterns of Lines and Segments in SpaceJános Pach, Richard Pollack, Emo Welzl. 439-446
- Efficient Parallel Algorithms for Path Problems in Planar Directed GraphsAndrzej Lingas. 447-457
- Parallel Algorithms for Finding Steiner Forests in Planar GraphsHitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki. 458-467
- Optimally Managing the History of an Evolving ForestVassilis J. Tsotras, B. Gopinath, George W. Hart. 468-478