| 1993 | A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed | Richa Agarwala, David Fernndez-Baca |
| 1993 | Synchronization power depends on the register size (Preliminary Version) | Yehuda Afek, Gideon Stupp |
| 1992 | Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract) | Chee-Keng Yap |
| 1992 | Algebraic Decision Trees and Euler Characteristics | Andrew Chi-Chih Yao |
| 1992 | Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time | Hubert Wagener |
| 1992 | Maximizing Non-Linear Concave Functions in Fixed Dimension | Sivan Toledo |
| 1992 | Efficient Self-Embedding of Butterfly Networks with Random Faults | Hisao Tamaki |
| 1992 | Communication on Noisy Channels: A Coding Theorem for Computation | Leonard J. Schulman |
| 1992 | Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract) | Alfredo De Santis, Giuseppe Persiano |
| 1992 | Fully Dynamic Biconnectivity in Graphs | Monika Rauch |
| 1992 | Newton's Method for Fractional Combinatorial Optimization | Tomasz Radzik |
| 1992 | Quadratic Dynamical Systems (Preliminary Version) | Yuri Rabinovich, Alistair Sinclair, Avi Wigderson |
| 1992 | Improved Lower Bounds for Shellsort | C. Greg Plaxton, Bjorn Poonen, Torsten Suel |
| 1992 | The Complexity of the Hajs Calculus | Toniann Pitassi, Alasdair Urquhart |
| 1992 | The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms | Victor Y. Pan, John H. Reif, Stephen R. Tate |
| 1992 | Undirected Connectivity in O(log ^1.5 n) Space | Noam Nisan, Endre Szemerdi, Avi Wigderson |
| 1992 | Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract) | Ketan Mulmuley |
| 1992 | Computing a Shortest k-Link Path in a Polygon | Joseph S. B. Mitchell, Christine D. Piatko, Esther M. Arkin |
| 1992 | The Asymptotic Complexity of Merging Networks | Peter Bro Miltersen, Mike Paterson, Jun Tarui |
| 1992 | Undecidability of the Horn-Clause Implication Problem | Jerzy Marcinkowski, Leszek Pacholski |
| 1992 | Computing in Solvable Matrix Groups | Eugene M. Luks |
| 1992 | On the Randomized Complexity of Volume and Diameter | Lszl Lovsz, Mikls Simonovits |
| 1992 | Enumerating the k Closest Pairs Optimally | Hans-Peter Lenhof, Michiel H. M. Smid |
| 1992 | On the Fault Tolerance of Some Popular Bounded-Degree Networks | Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman |
| 1992 | Efficient Inference of Partial Types | Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach |