| 1990 | Separating Sets of Hyperrectangles. | Fabrizio d'Amore, Paolo Giulio Franciosa |
| 1990 | The Complexity of Symmetric Functions in Parity Normal Forms. | Carsten Damm |
| 1990 | Affine Automata: A Technique to Generate Complex Images. | Karel Culk II, Simant Dube |
| 1990 | Parallel Construction of Minimal Suffix and Factor Automata. | Maxime Crochemore, Wojciech Rytter |
| 1990 | Decomposition of Semi Commutations. | Mireille Clerbout, D. Gonzalez |
| 1990 | On Fast Algorithms for Two Servers. | Marek Chrobak, Lawrence L. Larmore |
| 1990 | Some Properties of Zerotesting Bounded One-Way Multicounter Machines. | Ivana Cern |
| 1990 | Using Inductive Counting to Simulate Nondeterministic Computation. | Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes |
| 1990 | Retractions in Comparing Prolog Semantics (Extended Abstract). | Arie de Bruin, Erik P. de Vink |
| 1990 | A Logical Operational Semantics of Full Prolog, Part II: Built-in Predicates for Database Manipulation. | Egon Brger |
| 1990 | On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. | Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier |
| 1990 | On the Power of Uniform Families of Constant Depth Treshold Circuits. | Eric Allender, Ulrich Hertrampf |
| 1990 | Interrogative Complexity of omega-Languages' Recognition. | Maris Alberts |
| 1989 | How to Define Functionals of Free Structures in Typed Lambda Calculus. | Marek Zaionc |
| 1989 | Constructive Aspects of the Omega-Rule: Application to Proof Systems in Computer Science and Algorithmic Logic. | Serge Yoccoz |
| 1989 | On the Computational Efficiency of Symmetric Neural Networks. | Juraj Wiedermann |
| 1989 | On Varieties of Languages Closed Under Products with Counter. | Pascal Weil |
| 1989 | On the Length of Values in a Finite Transducer. | Andreas Weber |
| 1989 | Understanding Nets. | Boris A. Trakhtenbrot |
| 1989 | The Hoare-Like Verification System for a Language with an Exception Handling Mechanism. | Danuta Szczepanska |
| 1989 | One More Method For Proving Lower Bounds on the Formula Complexity of Boolean Functions. | Vladimir Stetsenko |
| 1989 | Finite Constants: Characterizations of a New Decidable Set of Constants. | Bernhard Steffen, Jens Knoop |
| 1989 | Optimal Data Flow Analysis via Observational Equivalence. | Bernhard Steffen |
| 1989 | A Coloring Algorithm for Interval Graphs. | Maciej Slusarek |
| 1989 | An Imperative Type Hierarchy with Partial Products. | Erik Meineche Schmidt, Michael I. Schwartzbach |