| 1991 | The Interval Skip List: A Data Structure for Finding All Intervals that Overlap a Point. | Eric N. Hanson |
| 1991 | A Fast Derandomization Schemes and Its Applications. | Yijie Han |
| 1991 | Parametric Search and Locating Supply Centers in Trees. | Greg N. Frederickson |
| 1991 | Offline Algorithms for Dynamic Minimum Spanning Tree Problems. | David Eppstein |
| 1991 | On Computing the Voronoi Diagram for Restricted Planar Figures. | Hristo N. Djidjev, Andrzej Lingas |
| 1991 | Finding Level-Ancestors in Dynamic Trees. | Paul F. Dietz |
| 1991 | The MINSUMCUT Problem. | Josep Daz, Alan Gibbons, Mike Paterson, Jacobo Torn |
| 1991 | Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation. | Olivier Devillers, Stefan Meiser, Monique Teillaud |
| 1991 | Geometric Searching and Link Distance (Extended Abstract). | Gautam Das, Giri Narasimhan |
| 1991 | Competitive Algorithms for the Weighted List Update Problem. | Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni |
| 1991 | Immobilizing a Polytope. | Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia |
| 1991 | A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). | Walter Cunto, J. Ian Munro, Patricio V. Poblete |
| 1991 | Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. | Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos |
| 1991 | A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. | Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint |
| 1991 | Approximation Algorithms for Selecting Network Centers (Preliminary Vesion). | Judit Bar-Ilan, David Peleg |
| 1991 | On the Zone of a Surface in a Hyperplane Arrangement. | Boris Aronov, Micha Sharir |
| 1991 | Geometric Knapsack Problems. | Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell |
| 1991 | Sharing Memory in Asynchronous Message Passing Systems. | Oscar R. Anguilar, Ajoy Kumar Datta, Sukumar Ghosh |
| 1991 | Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond. | Selim G. Akl |
| 1991 | Applications of a New Space Partitioning Technique. | Pankaj K. Agarwal, Micha Sharir |
| 1991 | Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. | Pankaj K. Agarwal, Jir Matousek, Subhash Suri |
| 1991 | Probabilistic Leader Election on Rings of Known Size. | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick |
| 1989 | Linear Time Algorithms for Computing Reachability Regions from Polygonal Figures. | Rongyao Zhao |
| 1989 | Motion Planning in the CL-Environment (Extended Abstract). | Chee-Keng Yap, Helmut Alt |
| 1989 | The Distribution of Keys in a Binary Heap. | Mark Allen Weiss, Jainendra K. Navlakha |