| 1984 | A New Definition of Morphism on Petri Nets. Glynn Winskel |
| 1984 | A Property of Three-Element Codes. Juhani Karhumäki |
| 1984 | Adherence Equivalence Is Decidable for DOL Languages. Tom Head |
| 1984 | Algebraic and Topological Theory of Languages and Computation, Part I: Theorems for Arbitrary Labguages Generalizing the Theorems of Eilenberg, Kleene, Schützenberger and Straubing. John Rhodes |
| 1984 | Algebre de machines et logique temporelle. Max Michel |
| 1984 | Approximation Schemes for Covering and Packing Problems in Robotics and VLSI. Dorit S. Hochbaum, Wolfgang Maass |
| 1984 | Automates a pile sur des alphabets infinis. Jeanne Idt |
| 1984 | Blocage et vivacité dans les réseaux a pile-file. Alain Finkel |
| 1984 | Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphimes iteres. Jean-Jacques Pansiot |
| 1984 | Computability in Higher Types and the Universal Domain P_omega. Giuseppe Longo, Simone Martini |
| 1984 | Computing the Largest Empty Rectangle. Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee |
| 1984 | Covering Polygons with Minimum Number of Rectangles. Christos Levcopoulos, Andrzej Lingas |
| 1984 | Denotational Semantics of Concurrent Programs with Shared Memory. Manfred Broy |
| 1984 | Efficient Simulations among Several Models of Parallel Computers. Friedhelm Meyer auf der Heide |
| 1984 | From Expanders to Better Superconcentrators without Cascading. Eli Shamir |
| 1984 | Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus. Axel Poigné |
| 1984 | Key-Problems and Key-Methods in Computational Geormetry. Herbert Edelsbrunner |
| 1984 | Locally Synchronous Complexity in the Light of the Trans-Box Method. Edward G. Belaga |
| 1984 | Logic Programs and Many-Valued Logic. Alan Mycroft |
| 1984 | On Expressive Interpretations of a Hoare-Logic for Clarke's Language L4. Bernhard Josko |
| 1984 | On Extendibility of Unavoidable Sets. Christian Choffrut, Karel Culík II |
| 1984 | On a General Weight of Trees. Rainer Kemp |
| 1984 | On the Structure of Polynomial Time Degrees. Klaus Ambos-Spies |
| 1984 | Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. Ondrej Sýkora, Imrich Vrto |
| 1984 | Polynomial Time Inference of General Pattern Languages. Klaus P. Jantke |
| 1984 | Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible. H. Perdrix |
| 1984 | Pushdown Space Complexity and Related Full-AFLs. Joaquim Gabarró |
| 1984 | STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings Max Fontet, Kurt Mehlhorn |
| 1984 | Some Recent Results on Squarefree Words. Jean Berstel |
| 1984 | Towards Executable Specifications Using Conditional Axioms. Klaus Drosten |
| 1984 | Transformations Realizing Fairness Assumptions for Parallel Programs. Krzysztof R. Apt, Ernst-Rüdiger Olderog |