| 1981 | A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit. Walter Knödel |
| 1981 | A Characterization of Floyd-Provable Programs. Hajnal Andréka, István Németi, Ildikó Sain |
| 1981 | A Framework for Studying Grammars. Branislav Rovan |
| 1981 | A General Framework for Comparing Sequential and Parallel Rewriting. H. C. M. Kleijn, Grzegorz Rozenberg |
| 1981 | A Starvation-Free Solution of the Dining Philosopher's Problem by Use of Interaction Systems. Horst F. Wedde |
| 1981 | A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. Deborah Joseph, Paul Young |
| 1981 | A Survey on Oracle Techniques. Bernhard Korte, Rainer Schrader |
| 1981 | Admissible Representations of Effective CPO's. Klaus Weihrauch, Gisela Schäfer |
| 1981 | An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages. Alberto Bertoni, Marco Brambilla, Giancarlo Mauri, Nicoletta Sabadini |
| 1981 | An Extension of Rabin's Complete Proof Concept. Jerzy W. Jaromczyk |
| 1981 | Another Hierarchy Defined by Multihead Finite Automata. Ladislav Janiga |
| 1981 | Axiomatic Semantics of Indirect Addressing. Juraj Steiner |
| 1981 | Axioms for the Term-Wise Correctness of Programs. Stefan Sokolowski |
| 1981 | Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. Juraj Hromkovic |
| 1981 | Codings of Nonnegative Integers. Ivan Korec |
| 1981 | Combining T and level-N. Werner Damm, Irène Guessarian |
| 1981 | Complexity and Entropy. Ludwig Staiger |
| 1981 | Constructive Category Theory (No. 1). Akira Kanda |
| 1981 | Fast Parallel Computation of Polynomials Using Few Processes. Leslie G. Valiant, Sven Skyum |
| 1981 | Generalizations of Petri Nets. Rüdiger Valk |
| 1981 | Grammatical Levels of the Position Restricted Grammars. Alica Kelemenová |
| 1981 | How to Find Invariants for Coloured Petri Nets. Kurt Jensen |
| 1981 | Key-Equivalence of Functional Dependency Statements Systems. Jaroslav Pokorný |
| 1981 | Making Dynamic Logic First-Order. Petr Hájek |
| 1981 | Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings Jozef Gruska, Michal Chytil |
| 1981 | Maximum Flow in Planar Networks. Ludek Kucera |
| 1981 | More about the "Geography" of Context-Free Languages. Joffroy Beauquier, Jean Berstel |
| 1981 | Multiplicative Complexity of a Bilinear Form over a Commutative Ring. Dima Grigoriev |
| 1981 | Negative Results on the Size of Deterministic Right Parsers. Jan Pittl |
| 1981 | On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation. Vladimir Yu. Sazonov |
| 1981 | On Realization and Implementation. Hans-Dieter Ehrich |
| 1981 | On Representations of Dynamic Algebras with Reversion. Jan Reiterman, Vera Trnková |
| 1981 | On Structural Similarity of Context-Free Grammars. Eljas Soisalon-Soininen, Derick Wood |
| 1981 | On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall |
| 1981 | On the Constructive Description of Graph Languages Accepted by Finite Automata. Hans-Jörg Kreowski, Grzegorz Rozenberg |
| 1981 | On the Power of Algebraic Specifications. Jan A. Bergstra, Manfred Broy, John V. Tucker, Martin Wirsing |
| 1981 | On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report). Franz-Josef Brandenburg |
| 1981 | Parsing Strategies: A Concise Survey (Preliminary Report). Anton Nijholt |
| 1981 | Partial Interpretations of Program Schemata. J. Horejs |
| 1981 | Partial Match Retrieval in Implicit Data Structures. Helmut Alt, Kurt Mehlhorn, J. Ian Munro |
| 1981 | Preserving Total Order in Constant Expected Time. Juraj Wiedermann |
| 1981 | Probabilistic Combinatorial Optimization. Karl J. Lieberherr |
| 1981 | Probabilistic Two-Way Machines. Rusins Freivalds |
| 1981 | Pushdown Automata with Restricted Use of Storage Symbols. Andreas Brandstädt |
| 1981 | Relationships between Probabilistic and Deterministic Tape Complexity. H. Jung |
| 1981 | Representations of Graphs by Means of Products and Their Complexity. Jaroslav Nesetril |
| 1981 | Retraceability, Repleteness and Busy Beaver Sets. Robert P. Daley |
| 1981 | Semantics of CSP via Translation into CCS. Egidio Astesiano, Elena Zucca |
| 1981 | Structured Nets. Ludmila Cherkasova, Vadim E. Kotov |
| 1981 | Testing of Join Dependency Preserving by a Modified Chase Method. Katsumi Tanaka, Yahiko Kambayashi |
| 1981 | The Art of Dynamizing. Jan van Leeuwen, Mark H. Overmars |
| 1981 | The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. Jon Louis Bentley, Thomas Ottmann |
| 1981 | The Maximum k-Flow in a Network. Václav Koubek, Antonín Ríha |
| 1981 | The Transformational Machine: Theme and Variations. Andrei P. Ershov |
| 1981 | Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). Burkhard Monien, Ivan Hal Sudborough |
| 1981 | Time-Processor Trade-offs for Universal Parallel Computers. Friedhelm Meyer auf der Heide |
| 1981 | Two Pebbles Don't Suffice. Lothar Budach |
| 1981 | Weighted Multidimensional B-trees Used as Nearly Optimal Dynamic Dictionaries. Hans-Peter Kriegel, Vijay K. Vaishnavi |