19. MFCS 1994: Kosice, Slovakia

Invited Papers

• Thomas Cheatham:
  Models, Languages, and Compiler Technology for High Performance Computers. 3-26
  
• Michel Cosnard, Martín Matamala:
  On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. 27-37
  
• Pavol Duris, José D. P. Rolim:
  E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. 38-51
  
• Stephen L. Bloom, Zoltán Ésik:
  Solving Polynomial Fixed Point Equations. 52-67
  
• Johann A. Makowsky:
  Capturing Complexity Classes with Lindström Quantifiers. 68-71
  
• Burkhard Monien, Ralf Diekmann, Reinhard Lüling:
  Communication Throughput of Interconnection Networks. 72-86
  
• James Lipton, Michael J. O'Donnell:
  Intuitive Counterexamples for Constructive Fallacies. 87-111
  
• Fernando Orejas, Elvira Pino, Hartmut Ehrig:
  Algebraic Methods in the Compositional Analysis of Logic Programs. 112-126
  
• Mike Paterson, Vlado Dancík:
  Longest Common Subsequences. 127-142
  
• Pavel A. Pevzner, Robert J. Lipshutz:
  Towards DNA Sequencing Chips. 143-158
  
• Jiri Sgall:
  On-Line Scheduling of Parallel Jobs. 159-176
  
• Glynn Winskel:
  Stable Bistructure Models of PCF. 177-197
  

Contributions

• Susanne Albers:
  A Competitive Analysis of the List Update Problem with Lookahead. 201-210
  
• Fabio Alessi, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro:
  May and Must Convergencey in Concurrent Lambda-Calculus. 211-220
  
• Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn:
  Genericity and Measure for Exponential Time. 221-232
  
• Ricardo A. Baeza-Yates:
  Analysis of Bounded Disorder. 233-244
  
• Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
  On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. 245-255
  
• Frank S. de Boer, M. van Hulst:
  A Proof System for Asynchronously Communicating Deterministic Processes. 256-265
  
• Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
  Embedding Complete Binary Trees into Star Networks. 266-275
  
• Carsten Damm, Markus Holzer:
  Inductive Counting Below LOGSPACE. 276-285
  
• Jürgen Dassow:
  Decision Problems for Edge Grammars. 286-295
  
• Frank K. H. A. Dehne, Rolf Klein:
  "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. 296-305
  
• Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów:
  Reliable Minimum Finding Comparator Networks. 306-315
  
• Anders Dessmark, Andrzej Lingas, Oscar Garrido:
  On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. 316-325
  
• Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger:
  A Comparison of Two Lower Bound Methods for Communication Complexity. 326-335
  
• S. Eyono Obono, Pavel Goralcik, M. N. Maksimenko:
  Efficient Solving of the Word Equations in One Variable. 336-341
  
• Gian Luigi Ferrari, Ugo Montanari, Paola Quaglia:
  A Pi-Calculus with Explicit Substitutions: the Late Semantics. 342-351
  
• Michael Forti, Furio Honsell, Marina Lenisa:
  Processes and Hyperuniverses. 352-363
  
• Felix Frayman, Valery Kanevsky, Walter W. Kirchherr:
  The Combinatorial Complexity of a Finite String. 364-372
  
• Robert Gold:
  A Fully Abstract Semantics for Termination in Petri Nets. 373-382
  
• Mirian Halfeld Ferrari Alves, Dominique Laurent, Nicolas Spyratos:
  Passive and Active Rules in Deductive Databases. 383-392
  
• Tibor Hegedüs:
  Combinatorial Results on the Complexity of Teaching and Learning. 393-402
  
• Montserrat Hermo:
  Degrees and Reducibilities of Easy Tally Sets. 403-412
  
• Hendrik Jan Hoogeboom, Paulien ten Pas:
  MSO Definable Text Languages. 413-422
  
• Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská:
  Two Lower Bounds on Distributive Generation of Languages. 423-432
  
• Paola Inverardi, Marisa Venturini Zilli:
  Rational Rewriting. 433-442
  
• Juhani Karhumäki, Wojciech Plandowski:
  On the Size of Independent Systems of Equations in Semigroups. 443-452
  
• Marek Karpinski, Wojciech Rytter:
  On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. 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. 462-472
  
• Ralf Klasing:
  The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. 473-483
  
• Petr Kurka:
  A Comparison of Finite and Cellular Automata. 484-493
  
• Klaus-Jörn Lange, Klaus Reinhardt:
  Empty Alternation. 494-503
  
• Bertrand Le Saëc, Igor Litovsky:
  On the Minimization Prolem for Omega-Automata. 504-514
  
• Christoph Meinel, Anna Slobodová:
  On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. 515-524
  
• H. Narayanan, Subir Roy, Sachin B. Patkar:
  Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions Approach. 525-535
  
• Rocco De Nicola, Anna Labella:
  A Completeness Theorem fro Nondeterministic Kleene Algebras. 536-545
  
• Marina Papatriantafilou, Philippas Tsigas:
  How a Rainbow Coloring Function Can Simulate Wait-Free Handshaking. 546-555
  
• Detlef Plump:
  Critical Pairs in Term Graph Rewriting. 556-566
  
• Corrado Priami, Daniel Yankelevich:
  Read-Write Causality. 567-576
  
• Gwénaël Richomme:
  Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable. 577-586
  
• Kai Salomaa, Derick Wood, Sheng Yu:
  Complexity of E0L Structural Equivalence. 587-596
  
• Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
  Shorter Queues for Permutation Routing on Meshes. 597-607
  
• Kurt Sieber:
  Full Abstraction for the Second Order Subset of an Algol-Like Language. 608-617
  
• Andreas Weber, Tom Head:
  The Finest Homophonic Partition and Related Code Concepts. 618-628
  

Last update Sat May 25 18:47:01 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page