10. MFCS 1981:
Strbske Pleso,
Czechoslovakia
Jozef Gruska, Michal Chytil (Eds.):
Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings.
Lecture Notes in Computer Science 118 Springer 1981, ISBN 3-540-10856-4 BibTeX
@proceedings{DBLP:conf/mfcs/1981,
editor = {Jozef Gruska and
Michal Chytil},
title = {Mathematical Foundations of Computer Science 1981, Strbske Pleso,
Czechoslovakia, August 31 - September 4, 1981, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {118},
year = {1981},
isbn = {3-540-10856-4},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Communications
- Helmut Alt, Kurt Mehlhorn, J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures.
156-161 BibTeX
- Hajnal Andréka, István Németi, Ildikó Sain:
A Characterization of Floyd-Provable Programs.
162-171 BibTeX
- Egidio Astesiano, Elena Zucca:
Semantics of CSP via Translation into CCS.
172-182 BibTeX
- Joffroy Beauquier, Jean Berstel:
More about the ``Geography'' of Context-Free Languages.
183-192 BibTeX
- Jan A. Bergstra, Manfred Broy, J. V. Tucker, Martin Wirsing:
On the Power of Algebraic Specifications.
193-204 BibTeX
- Alberto Bertoni, M. Brambilla, Giancarlo Mauri, Nicoletta Sabadini:
An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages.
205-215 BibTeX
- Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall:
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report).
216-223 BibTeX
- Franz-Josef Brandenburg:
On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report).
224-233 BibTeX
- Andreas Brandstädt:
Pushdown Automata with Restricted Use of Storage Symbols.
234-241 BibTeX
- Ludmila Cherkasova, Vadim E. Kotov:
Structured Nets.
242-251 BibTeX
- Robert P. Daley:
Retraceability, Repleteness and Busy Beaver Sets.
252-261 BibTeX
- Werner Damm, Irène Guessarian:
Combining T and level-N.
262-270 BibTeX
- Hans-Dieter Ehrich:
On Realization and Implementation.
271-280 BibTeX
- Dima Grigoriev:
Multiplicative Complexity of a Bilinear Form over a Commutative Ring.
281-286 BibTeX
- Petr Hájek:
Making Dynamic Logic First-Order.
287-295 BibTeX
- J. Horejs:
Partial Interpretations of Program Schemata.
296-303 BibTeX
- Juraj Hromkovic:
Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata.
304-313 BibTeX
- Ladislav Janiga:
Another Hierarchy Defined by Multihead Finite Automata.
314-320 BibTeX
- Jerzy W. Jaromczyk:
An Extension of Rabin's Complete Proof Concept.
321-326 BibTeX
- Kurt Jensen:
How to Find Invariants for Coloured Petri Nets.
327-338 BibTeX
- H. Jung:
Relationships between Probabilistic and Deterministic Tape Complexity.
339-346 BibTeX
- Alica Kelemenová:
Grammatical Levels of the Position Restricted Grammars.
347-359 BibTeX
- H. C. M. Kleijn, Grzegorz Rozenberg:
A General Framework for Comparing Sequential and Parallel Rewriting.
360-368 BibTeX
- Walter Knödel:
A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit.
369-378 BibTeX
- Ivan Korec:
Codings of Nonnegative Integers.
379-388 BibTeX
- Václav Koubek, Antonín Ríha:
The Maximum k-Flow in a Network.
389-397 BibTeX
- Hans-Jörg Kreowski, Grzegorz Rozenberg:
On the Constructive Description of Graph Languages Accepted by Finite Automata.
398-409 BibTeX
- Hans-Peter Kriegel, Vijay K. Vaishnavi:
Weighted Multidimensional B-trees Used as Nearly Optimal Dynamic Dictionaries.
410-417 BibTeX
- Ludek Kucera:
Maximum Flow in Planar Networks.
418-422 BibTeX
- Karl J. Lieberherr:
Probabilistic Combinatorial Optimization.
423-432 BibTeX
- Friedhelm Meyer auf der Heide:
Time-Processor Trade-offs for Universal Parallel Computers.
433-441 BibTeX
- Jan Pittl:
Negative Results on the Size of Deterministic Right Parsers.
442-451 BibTeX
- Jaroslav Pokorný:
Key-Equivalence of Functional Dependency Statements Systems.
452-462 BibTeX
- Jan Reiterman, Vera Trnková:
On Representations of Dynamic Algebras with Reversion.
463-472 BibTeX
- Branislav Rovan:
A Framework for Studying Grammars.
473-482 BibTeX
- Vladimir Yu. Sazonov:
On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation.
483-490 BibTeX
- Eljas Soisalon-Soininen, Derick Wood:
On Structural Similarity of Context-Free Grammars.
491-498 BibTeX
- Stefan Sokolowski:
Axioms for the Term-Wise Correctness of Programs.
499-507 BibTeX
- Ludwig Staiger:
Complexity and Entropy.
508-514 BibTeX
- Juraj Steiner:
Axiomatic Semantics of Indirect Addressing.
515-523 BibTeX
- Katsumi Tanaka, Yahiko Kambayashi:
Testing of Join Dependency Preserving by a Modified Chase Method.
524-533 BibTeX
- Horst Wedde:
A Starvation-Free Solution of the Dining Philosopher's Problem by Use of Interaction Systems.
534-543 BibTeX
- Klaus Weihrauch, Gisela Schäfer:
Admissible Representations of Effective CPO's.
544-553 BibTeX
- Juraj Wiedermann:
Preserving Total Order in Constant Expected Time.
554-562 BibTeX
- Akira Kanda:
Constructive Category Theory (No. 1).
563-577 BibTeX
Invited Lecture
Copyright © Sat May 16 23:29:33 2009
by Michael Ley (ley@uni-trier.de)
