13. MFCS 1988:
Carlsbad,
Czechoslovakia
Michal Chytil, Ladislav Janiga, Václav Koubek (Eds.):
Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings.
Lecture Notes in Computer Science 324 Springer 1988, ISBN 3-540-50110-X BibTeX
@proceedings{DBLP:conf/mfcs/1988,
editor = {Michal Chytil and
Ladislav Janiga and
V{\'a}clav Koubek},
title = {Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad,
Czechoslovakia, August 29 - September 2, 1988, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {324},
year = {1988},
isbn = {3-540-50110-X},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Communications
- Farid M. Ablayev:
Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability.
154-161 BibTeX
- E. Allevi, Alessandra Cherubini, Stefano Crespi-Reghizzi:
Breadth-First Phrase Structure Grammars and Queue Automata.
162-170 BibTeX
- Frank Bauernöppel, Hermann Jung:
Implementing Abstract Data Structures in Hardware.
171-179 BibTeX
- Joffroy Beauquier, Antoine Petit:
Distribution of Sequential Processes.
180-189 BibTeX
- Francis Bossut, Max Dauchet, Bruno Warin:
Automata and Rational Expressions on Planar Graphs.
190-200 BibTeX
- Véronique Bruyère:
On Maximal Prefix Sets of Words.
201-209 BibTeX
- Heino Carstensen:
Infinite Behaviour if Deterministic Petri Nets.
210-219 BibTeX
- Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik:
Testing Isomorphism of Outerplanar Graphs in Parallel.
220-230 BibTeX
- Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.
231-239 BibTeX
- Ryszard Danecki:
Multiple Propositional Dynamic Logic of Parallel Programs (Extended Abstract).
240-248 BibTeX
- Alessandro D'Atri, Marina Moscarini, Antonio Sassano:
The Steiner Tree Problem and Homogeneous Sets.
249-261 BibTeX
- Max Dauchet:
Termination of Rewriting is Undecidable in the One-Rule Case.
262-270 BibTeX
- Volker Diekert, Walter Vogler:
Local Checking of Trace Synchroniziability.
271-279 BibTeX
- Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto:
Edge Separators for Planar Graphs and Their Applications.
280-290 BibTeX
- Michael A. Frumkin:
A Fast Parallel Algorithm for Eigenvalue Problem of Jacobi Matrices.
291-299 BibTeX
- Ricard Gavaldà, José L. Balcázar:
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets.
300-308 BibTeX
- Viliam Geffert:
Context-Free-Like Forms for the Phrase-Structure Grammars.
309-317 BibTeX
- Andreas Goerdt:
On the Expressive Strength of the Finitely Typed Lambda-Terms.
318-328 BibTeX
- Andreas Goerdt:
Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook.
329-338 BibTeX
- Ursula Goltz:
On Representing CCS Programs by Finite Petri Nets.
339-350 BibTeX
- Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
351-359 BibTeX
- Juraj Hromkovic, Juraj Procházka:
Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays.
360-370 BibTeX
- Stasys Jukna:
Two Lower Bounds for Circuits over the Basis (&, V, -).
371-380 BibTeX
- Stéphane Kaplan:
Positive/Negative Conditional Rewriting.
381-395 BibTeX
- Jan Kratochvíl, Mirko Krivánek:
On the Computational Complexity of Codes in Graphs.
396-404 BibTeX
- Matthias Krause, Christoph Meinel, Stephan Waack:
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe.
405-413 BibTeX
- Kim Guldstrand Larsen, Bent Thomsen:
Compositional Proofs by Partial Specification of Processes.
414-423 BibTeX
- Dominique Laurent, Nicolas Spyratos:
Introducing Negative Information in Relational Databases.
424-432 BibTeX
- Philippe le Chenadec:
On Positive Occur-Checks in Unification.
433-444 BibTeX
- Krzysztof Lorys, Maciej Liskiewicz:
Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs.
445-453 BibTeX
- Satoru Miyano:
Delta2p-Complete Lexicographically First Maximal Subgraph Problems.
454-462 BibTeX
- Ewa Orlowska:
Proof System for Weakest Prespecification and its Applications.
463-471 BibTeX
- Marek Piotrów:
On Complexity of Counting.
472-482 BibTeX
- Qi Lu, Jiahua Qian:
Design, Proof and Analysis of New Efficient Algorithms for Incremental Attribute Evaluation.
483-491 BibTeX
- Peter Ruzicka:
On Efficiency of Interval Routing Algorithms.
492-500 BibTeX
- Peter Ruzicka, Igor Prívara:
An Almost Linear Robinson Unification ALgorithm.
501-511 BibTeX
- Petr Savický:
Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract).
512-517 BibTeX
- Anna Slobodová:
On the Power of Communication in Alternating Machines.
518-528 BibTeX
- Ewald Speckenmeyer:
Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability.
529-538 BibTeX
- Stefano Varricchio:
Bisections of Free Monoids and a New Unavoidable Regularity.
539-541 BibTeX
- Walter Vogler:
Failures Semantics and Deadlocking of Modular Petri Nets.
542-551 BibTeX
- Andreas Weber:
A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem.
552-562 BibTeX
Copyright © Sat May 16 23:29:33 2009
by Michael Ley (ley@uni-trier.de)
