| 1992 | (Un)expected Behavior of Typical Suffix Trees. Wojciech Szpankowski |
| 1992 | A Faster Algorithm for Finding the Minimum Cut in a Graph. Jianxiu Hao, James B. Orlin |
| 1992 | A Faster Deterministic Maximum Flow Algorithm. Valerie King, S. Rao, Robert Endre Tarjan |
| 1992 | A General Approximation Technique for Constrained Forest Problems. Michel X. Goemans, David P. Williamson |
| 1992 | Algorithms for Subset Testing and Finding Maximal Sets. Daniel M. Yellin |
| 1992 | An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. Christian Schwarz, Michiel H. M. Smid |
| 1992 | Applications of Parametric Searching in Geometric Optimization. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo |
| 1992 | Applications of the Fusion Tree Method to Computational Geometry and Searching. Dan E. Willard |
| 1992 | Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. Martin Fürer, Balaji Raghavachari |
| 1992 | Approximating the Minimum Weight Triangulation. David Eppstein |
| 1992 | Comparison-Sorting and Selecting in Totally Monotone Matrices. Noga Alon, Yossi Azar |
| 1992 | Computing Minimal Spanning Subgraphs in Linear Time. Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan |
| 1992 | Counting Networks with Arbitrary Fan-Out. Eran Aharonson, Hagit Attiya |
| 1992 | Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time. László Babai |
| 1992 | Deterministic Skip Lists. J. Ian Munro, Thomas Papadakis, Robert Sedgewick |
| 1992 | Directed Joseph Cheriyan, John H. Reif |
| 1992 | Dynamic Point Location in General Subdivisions. Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn |
| 1992 | Efficient Algorithms for the Hitchcock Transportation Problem. Takeshi Tokuyama, Jun Nakano |
| 1992 | Finding a Line Transversal of Axial Objects in Three Dimensions. Nina Amenta |
| 1992 | Finding the Repeated Median Regression Line. Andrew Stein, Michael Werman |
| 1992 | Generosity Helps, or an 11-Competitive Algorithm for Three Servers. Marek Chrobak, Lawrence L. Larmore |
| 1992 | Improved Approximations for the Steiner Tree Problem. Piotr Berman, Viswanathan Ramaiyer |
| 1992 | Improved Parallel Integer Sorting Without Concurrent Writing. Susanne Albers, Torben Hagerup |
| 1992 | Load Balancing Requires Omega(log Philip D. MacKenzie |
| 1992 | Lower Bounds for On-Line Graph Coloring. Magnús M. Halldórsson, Mario Szegedy |
| 1992 | Minimizing Capacity Violations in a Transshipment Network. Tomasz Radzik |
| 1992 | New Algorithms for Minimum Area David Eppstein |
| 1992 | On Efficient Unsuccessful Search. Lucas Chi Kwong Hui, Charles U. Martel |
| 1992 | On Likely Solutions of a Stable Matching Problem. Boris G. Pittel |
| 1992 | On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function. Yu Lin-Kriz, Victor Y. Pan |
| 1992 | On Playing "Twenty Questions" with a Liar. Aditi Dhagat, Péter Gács, Peter Winkler |
| 1992 | On the Approximation of Maximum Satisfiability. Mihalis Yannakakis |
| 1992 | On the Number of Eularian Orientations of a Graph. Milena Mihail, Peter Winkler |
| 1992 | On-Line Navigation in a Room. Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan |
| 1992 | Optimal Link Path Queries in a Simple Polygon. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri |
| 1992 | Parametric Optimization of Sequence Alignment. Dan Gusfield, K. Balasubramanian, Dalit Naor |
| 1992 | Pattern Matching in a Digitized Image. Gad M. Landau, Uzi Vishkin |
| 1992 | Percolation Theory and Computing with Faulty Arrays of Processors. Thomas R. Mathies |
| 1992 | Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA. Greg N. Frederickson |
| 1992 | Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. H. Narayanan, Huzur Saran, Vijay V. Vazirani |
| 1992 | Relative Neighborhood Graphs in Three Dimensions. Pankaj K. Agarwal, Jirí Matousek |
| 1992 | Searching Tree Structures on a Mesh of Processors. Jyh-Jong Tsay |
| 1992 | Self-Testing Polynomial Functions Efficiently and Over Rational Domains. Ronitt Rubinfeld, Madhu Sudan |
| 1992 | Separation and Approximation of Polyhedral Objects. Joseph S. B. Mitchell, Subhash Suri |
| 1992 | Sequential and Parallel Algorithms to Find a K André E. Kézdy, Patrick McGuinness |
| 1992 | Strong Concentration for Quicksort. Colin McDiarmid, Ryan Hayward |
| 1992 | Strongly Competitive Algorithms for Paging with Locality of Reference. Sandy Irani, Anna R. Karlin, Steven J. Phillips |
| 1992 | Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. Kurt Mehlhorn, Micha Sharir, Emo Welzl |
| 1992 | The Competitiveness of On-Line Assignments. Yossi Azar, Joseph Naor, Raphael Rom |
| 1992 | The Complexity of Heaps. Svante Carlsson, Jingsen Chen |
| 1992 | The On-Line Teofilo F. Gonzalez |
| 1992 | The Probabilistic Method. Joel Spencer |
| 1992 | The Robot Localization Problem in Two Dimensions. Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan |
| 1992 | Theoretical and Practical Aspects of Combinatorial Problem Solving. Martin Grötschel |
| 1992 | Two-Dimensional Periodicity and Its Applications. Amihood Amir, Gary Benson |