| 1979 | A Crossing Measure for 2-Tape Turing Machines. Gerd Wechsung |
| 1979 | A Note on Computational Complexity of a Statistical Deducibility Testing Procedure. Ivan Kramosil |
| 1979 | A Reduct-and-Closure Algorithm for Graphs. A. Goralciková, Václav Koubek |
| 1979 | A Sound and Complete Proof System for Partial Program Correctness. J. W. de Bakker |
| 1979 | A Survey of Grammar and L Forms-1978. Derick Wood |
| 1979 | A Survey of Some Syntactic Results in the lambda-Calculus. Gérard Berry, Jean-Jacques Lévy |
| 1979 | A Theoretical Study of the Time Analysis of Programs. Akeo Adachi, Takumi Kasai, Etsuro Moriya |
| 1979 | A Turing Machine Oracle Hierarchy. Stanislav Zák |
| 1979 | A Uniform Approach to Balanced Binary and Multiway Trees. Thomas Ottmann, Derick Wood |
| 1979 | An Algebraic Approach to Concurrence. Józef Winkowski |
| 1979 | An Algebraic Extension of the Chomsky-Hierarchy. Werner Damm |
| 1979 | Assertion Programming. Andrzej Blikle |
| 1979 | Axioms or Algorithms. Vaughan R. Pratt |
| 1979 | Bounded Recursion and Complexity Classes. Klaus W. Wagner |
| 1979 | Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets. Michael I. Dekhtyar |
| 1979 | Ch(k) Grammars: A Characterization of LL(k) Languages. Anton Nijholt, Eljas Soisalon-Soininen |
| 1979 | Characterization of Rational and Algebraic Power Series. Wolfgang Wechler |
| 1979 | Completeness Problems in Verification of Programs and Program Schemes. Hajnal Andréka, István Németi, Ildikó Sain |
| 1979 | Complexity Classes of Formal Languages (Preliminary Report). Ronald V. Book |
| 1979 | Computable Data Types. Gérard Comyn, G. Werner |
| 1979 | Computational Complexity of Approximation Algorithms for Combinatorial Problems. George Gens, Eugene Levner |
| 1979 | Computational Complexity of String and Graph Identification. A. O. Slisenko |
| 1979 | Context Free Normal Systems. Manfred Kudlek |
| 1979 | Dyck Language D Miron Tegze |
| 1979 | Fast Probabilistic Algorithms. Rusins Freivalds |
| 1979 | Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract). Jerzy Tiuryn |
| 1979 | Full Abstraction for a Simple Parallel Programming Language. Matthew Hennessy, Gordon D. Plotkin |
| 1979 | Fully Effective Solutions of Recursive Domain Equations. Akira Kanda |
| 1979 | Interactive L Systems with Almost Interactionless Behaviour. Karel Culík II, Juhani Karhumäki |
| 1979 | L-Fuzzy Functorial Automata. Vera Trnková |
| 1979 | LCF: A Way of Doing Proofs with a Machine. Robin Milner |
| 1979 | Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979 Jirí Becvár |
| 1979 | New Proofs for Jump DPDA's. Matti Linna, Martti Penttonen |
| 1979 | On Axiomatization of Deterministic Propositional Dynamic Logic. Mars K. Valiev |
| 1979 | On Multitape Automata. Hideki Yamasaki |
| 1979 | On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts. Guy Cousineau, Maurice Nivat |
| 1979 | On Relaxation Rules in Algorithmic Logic. Boris A. Trakhtenbrot |
| 1979 | On Some Recent Developments in Cryptography and Their Applications to Computer Science. Hermann A. Maurer |
| 1979 | On Two Types of Loops. Ivan M. Havel |
| 1979 | On the Generative Capacity of Some Classes of Grammars with Regulated Rewriting. Gheorghe Paun |
| 1979 | On the Languages of Bounded Petri Nets. Peter H. Starke |
| 1979 | On the Propositional Algorithmic Logic. Grazyna Mirkowska |
| 1979 | On the Sets of Minimal Indices of Partial Recursive Functions. G. B. Marandzjan |
| 1979 | On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. Robert P. Daley |
| 1979 | On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities. Thomas M. Fischer |
| 1979 | Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract). Tsutomu Kamimura, Giora Slutzki |
| 1979 | Power from Power Series. Arto Salomaa |
| 1979 | Program Equivalence and Provability. Guy Cousineau, Patrice Enjalbert |
| 1979 | Relationships between AFDL's and Cylinders. Jean-Michel Autebert |
| 1979 | Relative Succinctness of Representations of Languages and Separation of Complexity Classes. Juris Hartmanis, Theodore P. Baker |
| 1979 | Schematics of Structural Parallel Programming and its Applications. G. E. Tseytlin |
| 1979 | Searching, Sorting and Information Theory. Kurt Mehlhorn |
| 1979 | Small Universal Minsky Machines. Ludmila Gregusová, Ivan Korec |
| 1979 | Some Remarks on Boolean Sums. Kurt Mehlhorn |
| 1979 | Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup. Aldo de Luca, Antonio Restivo |
| 1979 | The Complexity of Lexicographic Sorting and Searching. Juraj Wiedermann |
| 1979 | The Problem of Reachability and Verification of Programs. J. M. Barzdin |
| 1979 | Validity Test for Floyd's Operator-Precedence Parsing Algorithms. Peter Ruzicka |