| 1994 | Efficient Solving of the Word Equations in One Variable. | S. Eyono Obono, Pavel Goralcik, M. N. Maksimenko |
| 1994 | A Completeness Theorem fro Nondeterministic Kleene Algebras. | Rocco De Nicola, Anna Labella |
| 1994 | Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions Approach. | H. Narayanan, Subir K. Roy, Sachin B. Patkar |
| 1994 | Communication Throughput of Interconnection Networks. | Burkhard Monien, Ralf Diekmann, Reinhard Lling |
| 1994 | On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. | Christoph Meinel, Anna Slobodov |
| 1994 | Capturing Complexity Classes with Lindstrm Quantifiers. | Johann A. Makowsky |
| 1994 | Intuitive Counterexamples for Constructive Fallacies. | James Lipton, Michael J. O'Donnell |
| 1994 | Empty Alternation. | Klaus-Jrn Lange, Klaus Reinhardt |
| 1994 | A Comparison of Finite and Cellular Automata. | Petr Kurka |
| 1994 | The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. | Ralf Klasing |
| 1994 | Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. | Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
| 1994 | On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. | Marek Karpinski, Wojciech Rytter |
| 1994 | On the Size of Independent Systems of Equations in Semigroups. | Juhani Karhumki, Wojciech Plandowski |
| 1994 | Rational Rewriting. | Paola Inverardi, Marisa Venturini Zilli |
| 1994 | Two Lower Bounds on Distributive Generation of Languages. | Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubsk |
| 1994 | MSO Definable Text Languages. | Hendrik Jan Hoogeboom, Paulien ten Pas |
| 1994 | Degrees and Reducibilities of Easy Tally Sets. | Montserrat Hermo |
| 1994 | Combinatorial Results on the Complexity of Teaching and Learning. | Tibor Hegeds |
| 1994 | A Fully Abstract Semantics for Termination in Petri Nets. | Robert Gold |
| 1994 | The Combinatorial Complexity of a Finite String. | Felix Frayman, Valery Kanevsky, Walter W. Kirchherr |
| 1994 | Processes and Hyperuniverses. | Michael Forti, Furio Honsell, Marina Lenisa |
| 1994 | A Pi-Calculus with Explicit Substitutions: the Late Semantics. | Gian-Luigi Ferrari, Ugo Montanari, Paola Quaglia |
| 1994 | E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. | Pavol Duris, Jos D. P. Rolim |
| 1994 | A Comparison of Two Lower Bound Methods for Communication Complexity. | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
| 1994 | On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. | Anders Dessmark, Andrzej Lingas, Oscar Garrido |