| 1992 | Testing Preorders for Probabilistic Processes. | Rance Cleaveland, Scott A. Smolka, Amy E. Zwarico |
| 1992 | Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. | Bernard Chazelle, Burton Rosenberg |
| 1992 | Characterization of Temporal Property Classes. | Edward Y. Chang, Zohar Manna, Amir Pnueli |
| 1992 | On Growing Context-Sensitive Languages. | Gerhard Buntrock, Krzysztof Lorys |
| 1992 | Buchberger's Algorithm: The Term Rewriter's Point of View (Extended Abstract). | Reinhard Bndgen |
| 1992 | Grbner Bases: An Introduction. | Bruno Buchberger |
| 1992 | Timing Petri Nets Categorically. | Carolyn Brown, Doug Gurr |
| 1992 | Near-perfect Token Distribution. | Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal |
| 1992 | Two Strikes Against Perfect Phylogeny. | Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow |
| 1992 | Reductions to Sets of Low Information Content. | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Kbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schning, Riccardo Silvestri, Thomas Thierauf |
| 1992 | Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). | Alberto Apostolico, Dany Breslauer, Zvi Galil |
| 1991 | CCS + Time = An Interleaving Model for Real Time Systems. | Wang Yi |
| 1991 | An Eilenberg Theorem for Infinity-Languages. | Thomas Wilke |
| 1991 | Deciding History Preserving Bisimilarity. | Walter Vogler |
| 1991 | Strutural Parallel Algorithmics. | Uzi Vishkin |
| 1991 | On Logics, Tilings, and Automata. | Wolfgang Thomas |
| 1991 | Logical and Computational Aspects of Programming with Sets/Bags/Lists. | Val Tannen, Ramesh Subrahmanyam |
| 1991 | Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion. | R. Ravi, Ajit Agrawal, Philip N. Klein |
| 1991 | Improving Known Solutions is Hard. | Desh Ranjan, Suresh Chari, Pankaj Rohatgi |
| 1991 | String Matching with Preprocessing of Text and Pattern. | Moni Naor |
| 1991 | A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. | Klaus Madlener, Paliath Narendran, Friedrich Otto |
| 1991 | Efficient Maximal Cubic Graph Cuts (Extended Abstract). | Martin Loebl |
| 1991 | Efficient Algorithms for Path Problems with Gernal Cost Citeria. | Thomas Lengauer, Dirk Theune |
| 1991 | The Expressive Power of Implicit Specifications. | Kim Guldstrand Larsen |
| 1991 | Finding Minimal Forbidden Minors Using a Finite Congruence. | Jens Lagergren, Stefan Arnborg |