| 518 | -- | 533 | David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. Computing the Intersection-Depth of Polyhedra |
| 534 | -- | 560 | Leonidas J. Guibas, David Salesin, Jorge Stolfi. Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives |
| 561 | -- | 571 | János Pach, Richard Pollack, Emo Welzl. Weaving Patterns of Lines and Line Segments in Space |
| 572 | -- | 590 | Tetsuo Asano, Takeshi Tokuyama. Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing |
| 591 | -- | 600 | Feng Gao 0002, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe. Finding Extrema with Unary Predicates |
| 601 | -- | 614 | Kuo-Hui Tsai, Wen-Lian Hsu. Fast Algorithms for the Dominating Set Problem on Permutation Graphs |
| 615 | -- | 628 | Tak Wah Lam, Kwong-fai Chan. Finding Least-Weight Subsequences with Fewer Processors |
| 629 | -- | 648 | Svante Carlsson, Christos Levcopoulos, Ola Petersson. Sublinear Merging and Natural Mergesort |
| 649 | -- | 668 | Kazumiti Numata, Takeshi Tokuyama. Splitting a Configuration in a Simplex |