| 1999 | IP Address Lookup Made Fast and Simple. | Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi |
| 1999 | On Constructing Suffix Arrays in External Memory. | Andreas Crauser, Paolo Ferragina |
| 1999 | Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. | Ferdinando Cicalese, Daniele Mundici |
| 1999 | On 2-Coverings and 2-Packings of Laminar Families. | Joseph Cheriyan, Tibor Jordn, R. Ravi |
| 1999 | On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees. | Ting Chen, Ming-Yang Kao |
| 1999 | Geometric Searching over the Rationals. | Bernard Chazelle |
| 1999 | Load Balancing Using Bisectors - A Tight Average-Case Analysis. | Stefan Bischof, Thomas Schickinger, Angelika Steger |
| 1999 | Quartet Cleaning: Improved Algorithms and Simulations. | Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham |
| 1999 | Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis. | Andrs A. Benczr, Jrg Frster, Zoltn Kirly |
| 1999 | The 3-Server Problem in the Plane. | Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore |
| 1999 | Efficient Algorithms for Integer Programs with Two Variables per Constraint. | Reuven Bar-Yehuda, Dror Rawitz |
| 1999 | Sum Multi-coloring of Graphs. | Amotz Bar-Noy, Magns M. Halldrsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai |
| 1999 | On-Line Load Banancing in a Hierarchical Server Topology. | Amotz Bar-Noy, Ari Freund, Joseph Naor |
| 1999 | Off-Line Temporary Tasks Assignment. | Yossi Azar, Oded Regev |
| 1999 | On List Update and Work Function Algorithms. | Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks |
| 1999 | Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms. | Ali Akhavi |
| 1999 | On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. | Alexander A. Ageev |
| 1998 | External Memory Algorithms. | Jeffrey Scott Vitter |
| 1998 | Design and Analysis of Dynamic Processes: A Stochastic Approach. | Eli Upfal |
| 1998 | Fast Algorithms for for Linear Algebra Modulo N. | Arne Storjohann, Thom Mulders |
| 1998 | 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. | Roberto Solis-Oba |
| 1998 | Two-Center Problems for a Convex Polygon (Extended Abstract). | Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa |
| 1998 | Computer-Aided Way to Prove Theorems in Scheduling. | Sergey V. Sevastianov, I. D. Tchernykh |
| 1998 | Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting. | J. Maurice Rojas |
| 1998 | Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. | Enrico Nardelli, Guido Proietti, Peter Widmayer |