12. MFCS 1986:
Bratislava,
Czechoslovakia
Jozef Gruska, Branislav Rovan, Juraj Wiedermann (Eds.):
Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings.
Lecture Notes in Computer Science 233 Springer 1986, ISBN 3-540-16783-8 BibTeX
@proceedings{DBLP:conf/mfcs/1986,
editor = {Jozef Gruska and
Branislav Rovan and
Juraj Wiedermann},
title = {Mathematical Foundations of Computer Science 1986, Bratislava,
Czechoslovakia, August 25-29, 1996, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {233},
year = {1986},
isbn = {3-540-16783-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Communications
- Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones.
199-208 BibTeX
- Egidio Astesiano, Gianna Reggio, Martin Wirsing:
Relational Specifications and Observational Semantics.
209-217 BibTeX
- Bernd Becker:
Efficient Testing of Optimal Time Adders (Extended Abstract).
218-229 BibTeX
- Siegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener:
Properties of Complexity Measures for PRAMs and WRAMs.
230-238 BibTeX
- Virgil Emil Cazanescu:
Iterative Systems of Equations.
239-246 BibTeX
- Alexander L. Chistov:
Polynomial Complexity of the Newton-Puiseux Algorithm.
247-255 BibTeX
- Marek Chrobak, Wojciech Rytter:
Unique Deciperability for Partially Commutative Alphabet (Extended Abstract).
256-263 BibTeX
- Karel Culik II, Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.
264-272 BibTeX
- Krzysztof Diks:
A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract).
273-282 BibTeX
- Branislav Durian:
Quicksort Without a Stack.
283-289 BibTeX
- S. Dvorák, Branislav Durian:
Towards an Efficient Merging.
290-298 BibTeX
- Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh:
Homomorphic Realizations of Automata with Compositions.
299-307 BibTeX
- Thomas M. Fischer:
Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional Space.
308-314 BibTeX
- Thomas M. Fischer, K. Wolfrum:
On the Inherent Combinatorial Complexity of Geometric Problems in D-Dimensional Space.
315-324 BibTeX
- Philippe Flajolet:
The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle.
325-340 BibTeX
- Hans Fleischhack:
P-Genericity and Strong G-Genericity.
341-349 BibTeX
- Christiane Frougny:
Fibonacci Numeration Systems and Rational Functions.
350-359 BibTeX
- B. Gammatie:
Safe Implementation Equivalence for Asynchronous Nondeterministic Processes.
360-369 BibTeX
- Viliam Geffert:
Grammars with Context Dependency Restricted to Synchronization.
370-378 BibTeX
- A. Goralciková, Václav Koubek:
Some Improved Parallelisms for Graphs.
379-385 BibTeX
- Susanne Graf:
A Complete Inference System for an Algebra or Regular Acceptance Models.
386-395 BibTeX
- Thomas Gundermann, Gerd Wechsung:
Nondeterministic Turing Machines with Modified Acceptance.
396-404 BibTeX
- Armin Hemmerling:
Remark on the Power of Compass (Extended Abstract).
405-413 BibTeX
- Friedhelm Hinz:
Regular Chain Code Picture Languages of Nonlinear Descriptional Complexity.
414-421 BibTeX
- Rodney R. Howell, Louis E. Rosier:
An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines.
422-430 BibTeX
- Juraj Hromkovic:
A New Approach to Defining the Complexity for VLSI.
431-439 BibTeX
- Stasys Jukna:
Lower Bounds on the Complexity of Local Circuits (Preliminary Report).
440-448 BibTeX
- Lubor Kollár:
Optimal Sorting of Seven Element Sets.
449-457 BibTeX
- Ivan Korec:
Undecidable Problems Concerning Generalized Pascal Triangles of Commutative Algebras.
458-466 BibTeX
- Václav Koubek, Antonín Ríha:
Regular Augmentation of Automata and Transducers (Extended Abstract).
467-475 BibTeX
- Ivan Kramosil:
On Some Types of Pseudo-Random Sequences.
476-483 BibTeX
- Klaus Kriegel:
The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus.
484-492 BibTeX
- Antonín Kucera:
An Alternative, Priority-Free, Solution to Post's Problem.
493-500 BibTeX
- Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo:
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.
501-511 BibTeX
- Werner Kuich:
Matrix Systems and Principal Cones of Algebraic Power Series.
512-517 BibTeX
- Klaus-Jörn Lange:
Two Characterizations of the Logarithmic Alternation Hierarchy.
518-526 BibTeX
- Christoph Meinel:
p-Projection Reducibility and the Complexity Classes L(nonuniform) and NL(nonuniform).
527-535 BibTeX
- Dominique Méry:
A Proof System to Derive Evantually Properties Under Justice Hypothesis.
536-544 BibTeX
- M. A. Nait Abdallah:
AL-Khowarizmi: A Formal System for Higher-Order Logic Programming.
545-553 BibTeX
- Fabienne Romian, Jacques Sakarovitch:
One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages.
554-563 BibTeX
- Brigitte Rozoy:
Model and Complexity of Termination for Distributed Computations.
564-572 BibTeX
- Vladislav Rutenburg:
Complexity of Generalized Graph Coloring.
573-581 BibTeX
- Paul G. Spirakis:
The Parallel Complexity of Deadlock Detection.
582-593 BibTeX
- Ludwig Staiger, Werner Nehrlich:
The Centers of Context-Sensitive Languages.
594-601 BibTeX
- Jorma Tarhio, Esko Ukkonen:
A Greedy Algorithm for Constructing Shortest Common Substrings.
602-610 BibTeX
- Heiko Vogler:
The OI-Hierarchy is Closed under Control.
611-619 BibTeX
- Andreas Weber, Helmut Seidl:
On the Degree of Ambiguity of Finite Automata.
620-629 BibTeX
Late Arrivals
Copyright © Sat May 16 23:29:33 2009
by Michael Ley (ley@uni-trier.de)
