| 1992 | Iterative Devices Generating Infinite Words. | Karel Culk II, Juhani Karhumki |
| 1992 | Speeding Up Two String-Matching Algorithms. | Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter |
| 1992 | A Theory of Strict P-completeness. | Anne Condon |
| 1992 | Mu-SPEED: A System for the Specification and Verification of Microprocessors. | Hlne Collavizza |
| 1992 | Four Results on Randomized Incremental Constructions. | Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel |
| 1992 | A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups. | Jean-Marc Champarnaud |
| 1992 | Characterizations of Some Complexity Classes Between Theta^p_2 and Delta^p_2. | Jorge Castro, Carlos Seara |
| 1992 | In-place Linear Probing Sort. | Svante Carlsson, Jyrki Katajainen, Jukka Teuhola |
| 1992 | Deterministic Regular Languages. | Anne Brggemann-Klein, Derick Wood |
| 1992 | On Complexity Classes and Algorithmically Random Languages (Extended Abstract). | Ronald V. Book, Jack H. Lutz, Klaus W. Wagner |
| 1992 | Equality and Disequality Constraints on Direct Subterms in Tree Automata. | Bruno Bogaert, Sophie Tison |
| 1992 | A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. | Hans L. Bodlaender, Ton Kloks |
| 1992 | On Locally Optimal Alignments in Genetic Sequences. | Norbert Blum |
| 1992 | The ANIGRAF System. | Michel Billaud |
| 1992 | Axiomatizations of Backtracking. | Michel Billaud |
| 1992 | Enclosing Many Boxes by an Optimal Pair of Boxes. | Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer |
| 1992 | Synthesis for Testability: Binary Decision Diagrams. | Bernd Becker |
| 1992 | A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects. | Frank Bartling, Klaus H. Hinrichs |
| 1992 | SPECI90: A Term Rewriting and Narrowing System. | Peter Bachmann, Thomas Drescher, Sabine Nieke |
| 1992 | The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. | Klaus Ambos-Spies, Andr Nies |
| 1991 | The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n. | Ingo Wegener |
| 1991 | Methodology for Proving the Termination of Logic Programs. | Bal Wang, R. K. Shyamasundar |
| 1991 | Bisimulation and Action Refinement. | Walter Vogler |
| 1991 | Efficient Memory Access in Large-Scale Computation. | Jeffrey Scott Vitter |
| 1991 | Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy. | Jun Tarui |