- 1994
- Susanne Albers:
A Competitive Analysis of the List Update Problem with Lookahead. MFCS 1994: 201-210 - Fabio Alessi, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro:
May and Must Convergencey in Concurrent Lambda-Calculus. MFCS 1994: 211-220 - Mirian Halfeld Ferrari Alves
, Dominique Laurent, Nicolas Spyratos:
Passive and Active Rules in Deductive Databases. MFCS 1994: 383-392 - Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn:
Genericity and Measure for Exponential Time. MFCS 1994: 221-232 - Ricardo A. Baeza-Yates:
Analysis of Bounded Disorder. MFCS 1994: 233-244 - Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. MFCS 1994: 245-255 - Stephen L. Bloom, Zoltán Ésik:
Solving Polynomial Fixed Point Equations. MFCS 1994: 52-67 - Frank S. de Boer, M. van Hulst:
A Proof System for Asynchronously Communicating Deterministic Processes. MFCS 1994: 256-265 - Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embedding Complete Binary Trees into Star Networks. MFCS 1994: 266-275 - Thomas Cheatham:
Models, Languages, and Compiler Technology for High Performance Computers. MFCS 1994: 3-26 - Michel Cosnard, Martín Matamala:
On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. MFCS 1994: 27-37 - Carsten Damm, Markus Holzer
:
Inductive Counting Below LOGSPACE. MFCS 1994: 276-285 - Jürgen Dassow:
Decision Problems for Edge Grammars. MFCS 1994: 286-295 - Frank K. H. A. Dehne, Rolf Klein:
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. MFCS 1994: 296-305 - Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów:
Reliable Minimum Finding Comparator Networks. MFCS 1994: 306-315 - Anders Dessmark, Andrzej Lingas, Oscar Garrido:
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. MFCS 1994: 316-325 - Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger:
A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335 - Pavol Duris, José D. P. Rolim:
E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. MFCS 1994: 38-51 - Gian-Luigi Ferrari
, Ugo Montanari, Paola Quaglia:
A Pi-Calculus with Explicit Substitutions: the Late Semantics. MFCS 1994: 342-351 - Michael Forti, Furio Honsell, Marina Lenisa:
Processes and Hyperuniverses. MFCS 1994: 352-363 - Felix Frayman, Valery Kanevsky, Walter W. Kirchherr:
The Combinatorial Complexity of a Finite String. MFCS 1994: 364-372 - Robert Gold:
A Fully Abstract Semantics for Termination in Petri Nets. MFCS 1994: 373-382 - Tibor Hegedüs:
Combinatorial Results on the Complexity of Teaching and Learning. MFCS 1994: 393-402 - Montserrat Hermo
:
Degrees and Reducibilities of Easy Tally Sets. MFCS 1994: 403-412 - Hendrik Jan Hoogeboom
, Paulien ten Pas:
MSO Definable Text Languages. MFCS 1994: 413-422 - Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages. MFCS 1994: 423-432 - Paola Inverardi, Marisa Venturini Zilli:
Rational Rewriting. MFCS 1994: 433-442 - Juhani Karhumäki, Wojciech Plandowski:
On the Size of Independent Systems of Equations in Semigroups. MFCS 1994: 443-452 - Marek Karpinski, Wojciech Rytter:
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. MFCS 1994: 453-461 - Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
:
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. MFCS 1994: 462-472