| 1991 | A Characterization of Binary Search Networks. Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli |
| 1991 | A Gemometrical Bound for Integer Programming with Polynomial Constraints. Bernd Bank, Teresa Krick, Reinhard Mandel, Pablo Solernó |
| 1991 | A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. Hans Dietmar Gröger |
| 1991 | A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). György Turán |
| 1991 | About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions. Danièle Beauquier, Maurice Nivat, Damian Niwinski |
| 1991 | Adaptive Linear List Reorganization for a System Processing Set Queries. Radhakrishna S. Valiveti, B. John Oommen, Jack R. Zgierski |
| 1991 | An Optimal Adaptive In-place Sorting Algorithm. Christos Levcopoulos, Ola Petersson |
| 1991 | Approximation Algorithms for Counting Problems in Finite Fields. Marek Karpinski |
| 1991 | Automatic Proof Methods for Algebraic Specifications. Emmanuel Kounalis, Michaël Rusinowitch |
| 1991 | Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. Conrado Martinez |
| 1991 | Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth. Dietmar Uhlig |
| 1991 | Computational Calculus and Hardest Languages of Automata with Abstract Storages. Jürgen Dassow, Klaus-Jörn Lange |
| 1991 | Computations Over Infinite Groups. Jin-Yi Cai |
| 1991 | Data Structures Maxima. Guy Louchard, Claire Kenyon, René Schott |
| 1991 | Degrees of Nondeterminism for Pushdown Automata. Kai Salomaa, Sheng Yu |
| 1991 | Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars. Luca Breveglieri, Claudio Citrini, Stefano Crespi-Reghizzi |
| 1991 | Differential Resultants and Subresultants. Marc Chardin |
| 1991 | Efficiency of Monte Carlo Algorithms in Numerical Analysis. Stefan Heinrich |
| 1991 | Exact Analysis of Three Tree Contraction Algorithms. Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha |
| 1991 | Fundamentals of Computation Theory, 8th International Symposium, FCT '91, Gosen, Germany, September 9-13, 1991, Proceedings Lothar Budach |
| 1991 | Graph Theoretical Methods for the Design of Parallel Algorithms. Rüdiger Reischuk |
| 1991 | Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems. Antoine Joux, Jacques Stern |
| 1991 | Information-Based Complexity: Recent Results and Open Problems. Joseph F. Traub |
| 1991 | Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. Claus-Peter Schnorr, M. Euchner |
| 1991 | Lower Bounds for Deterministic and Nondeterministic Branching Programs. Alexander A. Razborov |
| 1991 | Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). Juraj Hromkovic |
| 1991 | Number Theoretic Algorithms and Cryptology. Johannes A. Buchmann |
| 1991 | On Space-bounded Synchronized Alternating Turing Machines. Oscar H. Ibarra, Nicholas Q. Trân |
| 1991 | On Strong Separations from AC Eric Allender, Vivek Gore |
| 1991 | On the Complexity of Graph Reconstruction. Dieter Kratsch, Lane A. Hemachandra |
| 1991 | On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. Egon Wanke |
| 1991 | On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract). Peter M. W. Knijnenburg, Joost N. Kok |
| 1991 | On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). Jean Néraud |
| 1991 | Optimal Embedding of a Toroidal Array in a Linear Array. Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
| 1991 | Optimal versus Stable in Boolean Formulae. Stasys Jukna |
| 1991 | Recent Progress in Circuit and Communication Complexity (Abstract). Andrew Chi-Chih Yao |
| 1991 | Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. Janis Kaneps |
| 1991 | Some Notes on Threshold Circuits, and Multiplication in Depth 4. Thomas Hofmeister, Walter Hohberg, Susanne Köhling |
| 1991 | Systolic Y-Tree Automata: Closure Properties and Decision Problems. Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente |
| 1991 | The Complexity of Computing Maximal Word Functions. Danilo Bruschi, Giovanni Pighizzini |
| 1991 | The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. Christel Baier, Mila E. Majster-Cederbaum |
| 1991 | The Gauß Lattice Basis Reduction Algorithm Succeeds With Any Norm. Michael Kaib |
| 1991 | Unambiguity and Fewness for Logarithmic Space. Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith |
| 1991 | Unifying Binary-Search Trees and Permutations. Bogdan S. Chlebus, Imrich Vrto |