| 1991 | On Space-bounded Synchronized Alternating Turing Machines. | Oscar H. Ibarra, Nicholas Q. Trn |
| 1991 | Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). | Juraj Hromkovic |
| 1991 | Some Notes on Threshold Circuits, and Multiplication in Depth 4. | Thomas Hofmeister, Walter Hohberg, Susanne Khling |
| 1991 | Efficiency of Monte Carlo Algorithms in Numerical Analysis. | Stefan Heinrich |
| 1991 | A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. | Hans Dietmar Grger |
| 1991 | Systolic Y-Tree Automata: Closure Properties and Decision Problems. | Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente |
| 1991 | Computational Calculus and Hardest Languages of Automata with Abstract Storages. | Jrgen Dassow, Klaus-Jrn Lange |
| 1991 | Unifying Binary-Search Trees and Permutations. | Bogdan S. Chlebus, Imrich Vrto |
| 1991 | Differential Resultants and Subresultants. | Marc Chardin |
| 1991 | Computations Over Infinite Groups. | Jin-yi Cai |
| 1991 | Unambiguity and Fewness for Logarithmic Space. | Gerhard Buntrock, Birgit Jenner, Klaus-Jrn Lange, Peter Rossmanith |
| 1991 | Number Theoretic Algorithms and Cryptology. | Johannes A. Buchmann |
| 1991 | The Complexity of Computing Maximal Word Functions. | Danilo Bruschi, Giovanni Pighizzini |
| 1991 | Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars. | Luca Breveglieri, Claudio Citrini, Stefano Crespi-Reghizzi |
| 1991 | About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Bchi Conditions. | Danile Beauquier, Maurice Nivat, Damian Niwinski |
| 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 | The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. | Christel Baier, Mila E. Majster-Cederbaum |
| 1991 | On Strong Separations from AC | Eric Allender, Vivek Gore |
| 1989 | Constructivity, Computability, and Computational Complexity in Analysis. | Klaus Weihrauch |
| 1989 | The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract). | Egon Wanke |
| 1989 | On Restricted Boolean Circuits. | Gyrgy Turn |
| 1989 | The Computational Complexity of Cellular Automata. | Klaus Sutner |
| 1989 | Tree Language Problems in Pattern Recognition Theory (Extended Abstract). | Magnus Steinby |
| 1989 | Kolmogorov Complexity and Hausdorff Dimension. | Ludwig Staiger |