17. MFCS 1992: Prague, Czechoslovakia

@proceedings{DBLP:conf/mfcs/1992,
  editor    = {Ivan M. Havel and
               V{\'a}clav Koubek},
  title     = {Mathematical Foundations of Computer Science 1992, 17th International
               Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992,
               Proceedings},
  booktitle = {MFCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {629},
  year      = {1992},
  isbn      = {3-540-55808-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

• Pankaj K. Agarwal, Jirí Matousek: On Range Searching with Semialgebraic Sets. 1-13 BibTeX
• Josep Díaz: Graph Layout Problems. 14-23 BibTeX
• Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter: Parallel Recognition and Ranking of Context-Free Languages. 24-36 BibTeX
• Milena Mihail: On the Expansion of Combinatorial Polytopes. 37-49 BibTeX
• Pekka Orponen: Neural Networks and Complexity Theory. 50-61 BibTeX
• J. V. Tucker, Jeffery I. Zucker: Theory of Computation over Stream Algebras, and its Applications. 62-80 BibTeX
• Uzi Vishkin: Methods in Parallel Algorithmics (Abstract). 81 BibTeX
• Osamu Watanabe: On the Complexity of Small Description and Related Topics. 82-94 BibTeX
• Juraj Wiedermann: Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models. 95-111 BibTeX
• Avi Wigderson: The Complexity of Graph Connectivity. 112-132 BibTeX

Communications

• Holger Bast, Martin Dietzfelbinger, Torben Hagerup: A Perfect Parallel Dictionary. 133-141 BibTeX
• Bernd Becker, Joachim Hartmann: Some Remarks on the Test Complexity of Iterative Logic Arrays. 142-152 BibTeX
• Hans-Jörg Burtschick, Albrecht Hoene: The Degree Structure of 1-L Reductions. 153-161 BibTeX
• Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc: Promise Problems and Access to Unambiguous Computation. 162-171 BibTeX
• Suresh Chari, Desh Ranjan, Pankaj Rohatgi: On the Complexity of Incremental Computation. 172-180 BibTeX
• Christian Choffrut, Massimiliano Goldwurm: Rational Transductions and Complexity of Counting Problems. 181-190 BibTeX
• Hubert Comon, Maribel Fernández: Negation Elimination in Equational Formulae. 191-199 BibTeX
• José Félix Costa, Amílcar Sernadas, Cristina Sernadas, Hans-Dieter Ehrich: Object Interaction. 200-208 BibTeX
• Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos: Strong Normalization of Substitutions. 209-217 BibTeX
• Robert P. Daley, Bala Kalyanasundaram: Probabilistic and Pluralistic Learners with Mind Changes. 218-226 BibTeX
• Carsten Damm, Markus Holzer, Klaus-Jörn Lange: Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. 227-235 BibTeX
• Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte: On Computational Power of Weighted Finite Automata. 236-245 BibTeX
• Rainer Feldmann, Peter Mysliwietz: The Shuffle Exchange Network has a Hamiltonian Path. 246-254 BibTeX
• Paul Gastin, Antoine Petit: Poset Properties of Complex Traces. 255-263 BibTeX
• Andreas Goerdt: A Treshold for Unsatisfiability. 264-274 BibTeX
• Robert Gold: Dataflow Semantics for Petri Nets. 275-283 BibTeX
• Irène Guessarian, Marcos Veloso Peixoto: About Boundedness for some DATALOG and DATALOG_neg Programs. 284-297 BibTeX
• Torben Hagerup, Ola Petersson: Merging and Sorting Strings in Parallel. 298-306 BibTeX
• Petr Jancar, Frantisek Mráz, Martin Plátek: Characterization of Context-Free Languages by Erasing Automata. 307-314 BibTeX
• Lila Kari: Insertion and Deletion of Words: Determinism and Reversibility. 315-326 BibTeX
• Frantisek Kascak: Small Universal One-State Linear Operator Algorithm. 327-335 BibTeX
• Cosimo Laneve, Ugo Montanari: Mobility in the CC-Paradigm. 336-345 BibTeX
• Klaus-Jörn Lange, Peter Rossmanith: The Emptiness Problem for Intersections of Regular Languages. 346-354 BibTeX
• Hing Leung: On Finite Automata with Limited Nondeterminism. 355-363 BibTeX
• Igor Litovsky, Yves Métivier, Eric Sopena: Definitions and Comparisons of Local Computations on Graphs. 364-373 BibTeX
• Bruno Martin: Efficient Unidimensional Universal Cellular Automaton. 374-382 BibTeX
• Osamu Maruyama, Satoru Miyano: Inferring a Tree from Walks. 383-391 BibTeX
• Elvira Mayordomo: Almost Every Set in Exponential Time is P-Bi-Immune. 392-400 BibTeX
• David Murphy, Axel Poigné: A Functorial Semantics for Observed Concurrency. 401-411 BibTeX
• Edward Ochmanski: Modelling Concurrency with Semi-Commutations. 412-420 BibTeX
• John Pedersen: Decision Problems for Cellular Automata and Their Semigroups. 421-429 BibTeX
• G. Michele Pinna, Axel Poigné: On the Nature of Events. 430-441 BibTeX
• W. Preilowski, Elias Dahlhaus, Gerd Wechsung: New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. 442-450 BibTeX
• Teodor C. Przymusinski: Two Simple Characterizations of Well-Founded Semantics. 451-462 BibTeX
• S. Ramesh: Fully Abstract Semantics for Higher Order Communicating Systems. 463-471 BibTeX
• Nicolas Reimen: Superposable Trellis Automata. 472-482 BibTeX
• Thomas Roos, Gerhard Albers: Maintaining Proximity in Higher Dimensional Spaces. 483-493 BibTeX
• Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit: Characterizing Regular Languages with Polynomial Densities. 494-503 BibTeX
• Dongming Wang: A Strategy for Speeding-up the Computation of Characteristic Sets. 504-510 BibTeX
• Celia Wrathall, Volker Diekert, Friedrich Otto: One-Rule Trace-Rewriting Systems and Confluence. 511-521 BibTeX