11. MFCS 1984:
Praha,
Czechoslovakia
Michal Chytil, Václav Koubek (Eds.):
Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings.
Lecture Notes in Computer Science 176 Springer 1984, ISBN 3-540-13372-0 BibTeX
@proceedings{DBLP:conf/mfcs/1984,
editor = {Michal Chytil and
V{\'a}clav Koubek},
title = {Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia,
September 3-7, 1984, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {176},
year = {1984},
isbn = {3-540-13372-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Communications
- J. Albert:
On the Ehrenfeucht Conjecture on Test Sets and Its Dual Version.
176-184 BibTeX
- José L. Balcázar, Ronald V. Book, Uwe Schöning:
Sparse Oracles, Lowness, and Highness.
185-193 BibTeX
- Joffroy Beauquier, Loÿs Thimonier:
Computability of Probabilistic Parameters for Some Classes of Formal Languages.
194-204 BibTeX
- Franz-Josef Brandenburg:
A Truely Morphic Characterization of Recursively Enumerable Sets.
205-213 BibTeX
- Manfred Broy:
On the Herbrand Kleene Universe for Nondeterministic Computations.
214-222 BibTeX
- Hans-Dieter Burkhard:
An Investigation of Controls for Concurrent Systems by Abstract Control Languages.
223-231 BibTeX
- Anton Cerný:
On Generalized Words of Thue-Morse.
232-239 BibTeX
- Marek Chrobak:
Nondeterminism Is Essential for Two-Way Counter Machines.
240-244 BibTeX
- Gerardo Costa, Colin Stirling:
Weak and Strong Fairness in CCS.
245-254 BibTeX
- Robert P. Daley, Carl H. Smith:
On the Complexity of Inductive Inference (Preliminary Report).
255-264 BibTeX
- Herbert Edelsbrunner, Emo Welzl:
Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract).
265-272 BibTeX
- Patrice Enjalbert, Max Michel:
Many-Sorted Temporal Logic for Multi-Processes Systems.
273-281 BibTeX
- Z. Habasinski:
Process Logics: Two Decidability Results.
282-290 BibTeX
- Armin Hemmerling, Klaus Kriegel:
On Searching of Special Cases of Mazes and Finite Embedded Graphs.
291-300 BibTeX
- Matthew Hennessy, Colin Stirling:
The Power of the Future Perfect in Program Logics.
301-311 BibTeX
- Juraj Hromkovic:
Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines.
312-321 BibTeX
- Juraj Hromkovic:
On the Power of Alternation in Finite Automata.
322-329 BibTeX
- Oscar H. Ibarra, Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract).
330-338 BibTeX
- Jerzy W. Jaromczyk:
Lower Bounds for Polygon Simplicity Testing and Other Problems.
339-347 BibTeX
- Max I. Kanovic:
A Uniform Independence of Invariant Sentences.
348-354 BibTeX
- Juhani Karhumäki, H. C. M. Kleijn:
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages.
355-363 BibTeX
- Wojciech Kowalczyk:
Some Connections between Representability of Complexity Classes and the Power of Formal Systems of Reasoning.
364-369 BibTeX
- Ludek Kucera:
Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time.
370-377 BibTeX
- Klaus-Jörn Lange:
Nondeterministic Logspace Reductions.
378-388 BibTeX
- Arjen K. Lenstra:
Factoring Multivariate Polynomials over Algebraic Number Fields.
389-396 BibTeX
- Giuseppe Longo, Eugenio Moggi:
Gödel Numberings, Principal Morphisms, Combinatory Algebras: A Category-theoretic Characterization of Functional Completeness.
397-406 BibTeX
- Aldo de Luca, Antonio Restivo:
Representations lf Integers and Language Theory.
407-415 BibTeX
- Jaroslav Morávek, Pavel Pudlák:
New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming.
416-424 BibTeX
- A. Sh. Nepomnjashchaja:
Decidability of the Equivalence Problem for Synchronous Deterministic Pushdown Automata.
425-432 BibTeX
- Rocco De Nicola:
Models and Operators for Nondeterministic Processes.
433-442 BibTeX
- B. John Oommen:
Algorithms for String Editing which Permit Arbitrarily Complex Editing Constraints.
443-451 BibTeX
- Pekka Orponen, Uwe Schöning:
The Structure of Polynomial Complexity Cores (Extended Abstract).
452-458 BibTeX
- Thomas Ottmann, Peter Widmayer:
Solving Visibility Problems by Using Skeleton Structures.
459-470 BibTeX
- Axel Poigné:
Another Look at Parameterization Using Algebras with Subsorts.
471-479 BibTeX
- Pavel Pudlák:
A Lower Bound on Complexity of Branching Programs (Extended Abstract).
480-489 BibTeX
- Jan Reiterman, Vera Trnková:
From Dynamic Algebras to Test Algebras.
490-497 BibTeX
- J. M. Robson:
Combinatorial Games with Exponential Space Complete Decision Problems.
498-506 BibTeX
- Wojciech Rytter:
Fast Recognition of Pushdown Automaton and Context-Free Languages.
507-515 BibTeX
- Peter H. Starke:
Multiprocessor Systems and Their Concurrency.
516-525 BibTeX
- Andrzej Tarlecki:
Free Constructions in Algebraic Institutions.
526-534 BibTeX
- Jerzy Tiuryn, Pawel Urzyczyn:
Remarks on Comparing Expressive Power of Logics of Programs.
535-543 BibTeX
- K. Wagner:
The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract).
544-552 BibTeX
- Ingo Wegener:
On the Complexity of Slice Functions.
553-561 BibTeX
- Stanislav Zák:
An Exponential Lower Bound for One-Time-Only Branching Programs.
562-566 BibTeX
Invited Lecture
Communications
Copyright © Sat May 16 23:29:33 2009
by Michael Ley (ley@uni-trier.de)
