MFCS B

54 papers

YearTitle / Authors
19883-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles.
John H. Reif, James A. Storer
1988A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem.
Andreas Weber
1988A Fast Parallel Algorithm for Eigenvalue Problem of Jacobi Matrices.
Michael A. Frumkin
1988A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
1988An Almost Linear Robinson Unification ALgorithm.
Peter Ruzicka, Igor Prívara
1988Automata and Rational Expressions on Planar Graphs.
Francis Bossut, Max Dauchet, Bruno Warin
1988Bisections of Free Monoids and a New Unavoidable Regularity.
Stefano Varricchio
1988Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays.
Juraj Hromkovic, Juraj Procházka
1988Breadth-First Phrase Structure Grammars and Queue Automata.
E. Allevi, Alessandra Cherubini, Stefano Crespi-Reghizzi
1988Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability.
Ewald Speckenmeyer
1988Comparing Interconnection Networks.
Burkhard Monien, Ivan Hal Sudborough
1988Compositional Proofs by Partial Specification of Processes.
Kim Guldstrand Larsen, Bent Thomsen
1988Context-Free-Like Forms for the Phrase-Structure Grammars.
Viliam Geffert
1988Design, Proof and Analysis of New Efficient Algorithms for Incremental Attribute Evaluation.
Qi Lu, Jiahua Qian
1988Distribution of Sequential Processes.
Joffroy Beauquier, Antoine Petit
1988Edge Separators for Planar Graphs and Their Applications.
Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
1988Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.
Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
1988Failures Semantics and Deadlocking of Modular Petri Nets.
Walter Vogler
1988Functional Programming and Combinatory Algebras.
Corrado Böhm
1988Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook.
Andreas Goerdt
1988Implementing Abstract Data Structures in Hardware.
Frank Bauernöppel, Hermann Jung
1988Inductive Syntactical Synthesis of Programs from Sample Computations.
Efim B. Kinber
1988Infinite Behaviour if Deterministic Petri Nets.
Heino Carstensen
1988Introducing Negative Information in Relational Databases.
Dominique Laurent, Nicolas Spyratos
1988Local Checking of Trace Synchroniziability.
Volker Diekert, Walter Vogler
1988Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings
Michal Chytil, Ladislav Janiga, Václav Koubek
1988Multiple Propositional Dynamic Logic of Parallel Programs (Extended Abstract).
Ryszard Danecki
1988On Complexity of Counting.
Marek Piotrów
1988On Efficiency of Interval Routing Algorithms.
Peter Ruzicka
1988On Maximal Prefix Sets of Words.
Véronique Bruyère
1988On Models and Algebras for Concurrent Processes.
Ludmila Cherkasova
1988On Positive Occur-Checks in Unification.
Philippe le Chenadec
1988On Representing CCS Programs by Finite Petri Nets.
Ursula Goltz
1988On the Computational Complexity of Codes in Graphs.
Jan Kratochvíl, Mirko Krivánek
1988On the Expressive Strength of the Finitely Typed Lambda-Terms.
Andreas Goerdt
1988On the Power of Communication in Alternating Machines.
Anna Slobodová
1988Positive/Negative Conditional Rewriting.
Stéphane Kaplan
1988Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability.
Farid M. Ablayev
1988Proof System for Weakest Prespecification and its Applications.
Ewa Orlowska
1988Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract).
Petr Savický
1988Recognizable Sets with Multiplicities in the Tropical Semiring.
Imre Simon
1988Reusable Specification Components.
Martin Wirsing, Rolf Hennicker, Ruth Breu
1988Robust Orale Machines.
Uwe Schöning
1988Separating the Eraser Turing Machine Classes L
Matthias Krause, Christoph Meinel, Stephan Waack
1988Sparse Sets, Tally Sets, and Polynomial Reducibilities.
Ronald V. Book
1988String Matching with Constraints.
Maxime Crochemore
1988Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets.
Ricard Gavaldà, José L. Balcázar
1988Structure of Complexity Classes: Separations, Collapses, and Completeness.
Lane A. Hemachandra
1988Termination of Rewriting is Undecidable in the One-Rule Case.
Max Dauchet
1988Testing Isomorphism of Outerplanar Graphs in Parallel.
Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik
1988The Steiner Tree Problem and Homogeneous Sets.
Alessandro D'Atri, Marina Moscarini, Antonio Sassano
1988Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs.
Krzysztof Lorys, Maciej Liskiewicz
1988Two Lower Bounds for Circuits over the Basis (&, V, -).
Stasys Jukna
1988Δ
Satoru Miyano