| 1993 | General Solution of Mirror Equation. | Habib Abdulrab, Marianne Maksimenko |
| 1991 | Recent Progress in Circuit and Communication Complexity (Abstract). | Andrew Chi-Chih Yao |
| 1991 | On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. | Egon Wanke |
| 1991 | Adaptive Linear List Reorganization for a System Processing Set Queries. | Radhakrishna S. Valiveti, B. John Oommen, Jack R. Zgierski |
| 1991 | Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth. | Dietmar Uhlig |
| 1991 | A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). | Gyrgy Turn |
| 1991 | Information-Based Complexity: Recent Results and Open Problems. | Joseph F. Traub |
| 1991 | Optimal Embedding of a Toroidal Array in a Linear Array. | Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 1991 | Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. | Claus-Peter Schnorr, M. Euchner |
| 1991 | Degrees of Nondeterminism for Pushdown Automata. | Kai Salomaa, Sheng Yu |
| 1991 | Graph Theoretical Methods for the Design of Parallel Algorithms. | Rdiger Reischuk |
| 1991 | Lower Bounds for Deterministic and Nondeterministic Branching Programs. | Alexander A. Razborov |
| 1991 | Exact Analysis of Three Tree Contraction Algorithms. | Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha |
| 1991 | On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). | Jean Nraud |
| 1991 | Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. | Conrado Martinez |
| 1991 | Data Structures Maxima. | Guy Louchard, Claire Kenyon, Ren Schott |
| 1991 | An Optimal Adaptive In-place Sorting Algorithm. | Christos Levcopoulos, Ola Petersson |
| 1991 | On the Complexity of Graph Reconstruction. | Dieter Kratsch, Lane A. Hemachandra |
| 1991 | Automatic Proof Methods for Algebraic Specifications. | Emmanuel Kounalis, Michal Rusinowitch |
| 1991 | On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract). | Peter M. W. Knijnenburg, Joost N. Kok |
| 1991 | Approximation Algorithms for Counting Problems in Finite Fields. | Marek Karpinski |
| 1991 | Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. | Janis Kaneps |
| 1991 | The Gau Lattice Basis Reduction Algorithm Succeeds With Any Norm. | Michael Kaib |
| 1991 | Optimal versus Stable in Boolean Formulae. | Stasys Jukna |
| 1991 | Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems. | Antoine Joux, Jacques Stern |