| 1981 | Key-Equivalence of Functional Dependency Statements Systems. | Jaroslav Pokorn |
| 1981 | Negative Results on the Size of Deterministic Right Parsers. | Jan Pittl |
| 1981 | Parsing Strategies: A Concise Survey (Preliminary Report). | Anton Nijholt |
| 1981 | Representations of Graphs by Means of Products and Their Complexity. | Jaroslav Nesetril |
| 1981 | Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). | Burkhard Monien, Ivan Hal Sudborough |
| 1981 | Probabilistic Combinatorial Optimization. | Karl J. Lieberherr |
| 1981 | The Art of Dynamizing. | Jan van Leeuwen, Mark H. Overmars |
| 1981 | Maximum Flow in Planar Networks. | Ludek Kucera |
| 1981 | Weighted Multidimensional B-trees Used as Nearly Optimal Dynamic Dictionaries. | Hans-Peter Kriegel, Vijay K. Vaishnavi |
| 1981 | On the Constructive Description of Graph Languages Accepted by Finite Automata. | Hans-Jrg Kreowski, Grzegorz Rozenberg |
| 1981 | The Maximum k-Flow in a Network. | Vclav Koubek, Antonn Rha |
| 1981 | A Survey on Oracle Techniques. | Bernhard Korte, Rainer Schrader |
| 1981 | Codings of Nonnegative Integers. | Ivan Korec |
| 1981 | A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit. | Walter Kndel |
| 1981 | A General Framework for Comparing Sequential and Parallel Rewriting. | H. C. M. Kleijn, Grzegorz Rozenberg |
| 1981 | Grammatical Levels of the Position Restricted Grammars. | Alica Kelemenov |
| 1981 | Constructive Category Theory (No. 1). | Akira Kanda |
| 1981 | Relationships between Probabilistic and Deterministic Tape Complexity. | H. Jung |
| 1981 | A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. | Deborah Joseph, Paul Young |
| 1981 | How to Find Invariants for Coloured Petri Nets. | Kurt Jensen |
| 1981 | An Extension of Rabin's Complete Proof Concept. | Jerzy W. Jaromczyk |
| 1981 | Another Hierarchy Defined by Multihead Finite Automata. | Ladislav Janiga |
| 1981 | Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. | Juraj Hromkovic |
| 1981 | Partial Interpretations of Program Schemata. | J. Horejs |
| 1981 | Time-Processor Trade-offs for Universal Parallel Computers. | Friedhelm Meyer auf der Heide |