| 1991 | A Decidable Case of the Semi-Unification Problem. Hans Leiß, Fritz Henglein |
| 1991 | A Model for Real-Time Systems. Padmanabhan Krishnan |
| 1991 | A Second-Order Pattern Matching Algorithm for the Cube of Typed Lambda-Calculi. Gilles Dowek |
| 1991 | A Solution of the Complement Problem in Associative-Commutative Theories. Emmanuel Kounalis, Denis Lugiez, Loic Pottier |
| 1991 | Abstract Dynamic Data Types: A Temporal Logic Approach. Gerardo Costa, Gianna Reggio |
| 1991 | An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. Peter Ruzicka |
| 1991 | An Extensional Partial Combinatory Algebra Based on Lamda-Terms. Ramón Pino Pérez |
| 1991 | Atomic Refinement in Process Description Languages. Pierpaolo Degano, Roberto Gorrieri |
| 1991 | CCS Dynamic Bisimulation is Progressing. Ugo Montanari, Vladimiro Sassone |
| 1991 | Composition of Two Semi Commutations. Yves Roos, Pierre-André Wacrenier |
| 1991 | Different Modifications of Pointer Machines and Their Computational Power. Konstantin V. Shvachko |
| 1991 | Efficient Constructions of Test Sets for Regular and Context-Free Languages. Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek |
| 1991 | Elimination of Negation in Term Algebras. Jean-Louis Lassez, Michael J. Maher, Kim Marriott |
| 1991 | Extending Temporal Logic by Explicit Concurrency. Barbara Paech |
| 1991 | Generating Words by Cellular Automata. Anton Cerný |
| 1991 | Infinite Normal Forms for Non-Linear Term Rewriting Systems. Paola Inverardi, Monica Nesi |
| 1991 | Maintaining Dictionaries in a Hierarchical Memory. Claudia Leopold |
| 1991 | Mathematical Foundations of Computer Science 1991, 16th International Symposium, MFCS'91, Kazimierz Dolny, Poland, September 9-13, 1991, Proceedings Andrzej Tarlecki |
| 1991 | Models for Concurrency. Mogens Nielsen |
| 1991 | Observing Localities (Extended Abstract). Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn |
| 1991 | On Strict Codes. Nguyen Huong Lam, Do Long Van |
| 1991 | On a Hierarchy of File Types and a Tower of Their Theories. Andrzej Salwicki |
| 1991 | On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. Damian Niwinski |
| 1991 | On the Faithfulness of Formal Models. Zohar Manna, Amir Pnueli |
| 1991 | Once More on Order-Sorted Algebras. Axel Poigné |
| 1991 | Partial Higher-Order Specifications. Egidio Astesiano, Maura Cerioli |
| 1991 | Pattern Matching in Order-Sorted Languages. Delia Kesner |
| 1991 | Recognizable Complex Trace Languages. Volker Diekert, Paul Gastin, Antoine Petit |
| 1991 | Rewrite Orderings and Termination of Rewrite Systems. Pierre Lescanne |
| 1991 | Single-Path Petri Nets. Rodney R. Howell, Petr Jancar, Louis E. Rosier |
| 1991 | Solving Systems of Linear Diophantine Equations: An Algebraic Approach. Eric Domenjoud |
| 1991 | Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata. Oscar H. Ibarra, Tao Jiang, Hui Wang |
| 1991 | Stochastic Automata and Length Distributions of Rational Languages. Georges Hansel, Daniel Krob, Christian Michaux |
| 1991 | Strong Conjunction and Intersection Types. Fabio Alessi, Franco Barbanera |
| 1991 | Syntax and Semantics of a Monotonic Framework for Non-Monotonic Reasoning. M. A. Nait Abdallah |
| 1991 | The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). Juraj Hromkovic, Burkhard Monien |
| 1991 | The Complexity of The Reliable Connectivity Problem. Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis |
| 1991 | The Limit of Split_n-Bisimulations for CCS Agents. Roberto Gorrieri, Cosimo Laneve |
| 1991 | The lazy call-by-value Lamda-Calculus. Lavinia Egidi, Furio Honsell, Simona Ronchi Della Rocca |
| 1991 | Towards a Categorical Semantics Type Classes. Barney P. Hilken, David E. Rydeheard |
| 1991 | Two Algorithms for Approximate String Matching in Static Texts. Petteri Jokinen, Esko Ukkonen |
| 1991 | Two Over Three: A Two-Valued Logic for Software Specification and Validation Over a Three-Valued Predicate Calculus. Beata Konikowska |
| 1991 | Unification in Incompletely Specified Theories: A Case Study. Staffan Bonnier |
| 1991 | Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. Christoph Meinel, Stephan Waack |