18. MFCS 1993:
Gdansk,
Poland
Andrzej M. Borzyszkowski, Stefan Sokolowski (Eds.):
Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings.
Lecture Notes in Computer Science 711 Springer 1993, ISBN 3-540-57182-5 BibTeX
@proceedings{DBLP:conf/mfcs/1993,
editor = {Andrzej M. Borzyszkowski and
Stefan Sokolowski},
title = {Mathematical Foundations of Computer Science 1993, 18th International
Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3,
1993, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {711},
year = {1993},
isbn = {3-540-57182-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Contributions
- Laurent Alonso, René Schott:
On the Tree Inclusion Problem.
211-221 BibTeX
- Roberto M. Amadio:
On the Adequacy of Per Models.
222-231 BibTeX
- Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content.
232-241 BibTeX
- Egidio Astesiano, Gianna Reggio, Elena Zucca:
Stores as Homomorphisms and their Transformations.
242-251 BibTeX
- J. W. de Bakker, Franck van Breugel, Arie de Bruin:
Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands.
252-261 BibTeX
- Danièle Beauquier, Andreas Podelski:
Rabin Tree Automata and Finite Monoids.
262-271 BibTeX
- Marcin Benke:
Efficient Type Reconstruction in the Presence of Inheritance.
272-280 BibTeX
- Jean Berstel, Patrice Séébold:
A Characterization of Sturmian Morphisms.
281-290 BibTeX
- Hans L. Bodlaender, Klaus Jansen:
On the Complexity of Scheduling Incompatible Jobs with Unit-Times.
291-300 BibTeX
- Marcello M. Bonsangue, Joost N. Kok:
Isomorphisms between Predicates and State Transformers.
301-310 BibTeX
- Liming Cai, Jianer Chen:
On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract).
311-320 BibTeX
- Ilaria Castellani:
Observing Distribution in Processes.
321-331 BibTeX
- Christophe Cérin, Antoine Petit:
Speedup of Recognizable Trace Languages.
332-341 BibTeX
- Maura Cerioli, José Meseguer:
May I Borrow Your Logic?
342-351 BibTeX
- Shiva Chaudhuri, Torben Hagerup, Rajeev Raman:
Approximate and Exact Deterministic Parallel Selection.
352-361 BibTeX
- Jian Chen, John Staples:
Defining Soft Sortedness by Abstract Interpretation.
362-371 BibTeX
- Liang Chen:
A Model for Real-Time Process Algebras (Extended Abstract).
372-381 BibTeX
- José Félix Costa, Amílcar Sernadas, Cristina Sernadas:
Data Encapsulation and Modularity: Three Views of Inheritance.
382-391 BibTeX
- Karel Culik II, Jarkko Kari:
Image Compression Using Weighted Finite Automata.
392-402 BibTeX
- Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno:
Filter Models for a Parallel and Non Deterministic Lambda-Calculus.
403-412 BibTeX
- Pietro Di Gianantonio:
Real Number Computability and Domain Theory.
413-422 BibTeX
- Zinovy Diskin, Ilya Beylin:
Lambda Substitution Algebras.
423-432 BibTeX
- Bruno Durand:
Global Properties of 2D Cellular Automata: Some Complexity Results.
433-441 BibTeX
- Uffe Engberg, Glynn Winskel:
Completeness Results for Linear Logic on Petri Nets.
442-452 BibTeX
- Alessandro Fantechi, Stefania Gnesi, V. Perticaroli:
An Expressive Logic for Basic Process Algebra.
453-462 BibTeX
- Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum:
The Complexity of Finding Replicas Using Equality Tests.
463-472 BibTeX
- Rob J. van Glabbeek:
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours.
473-484 BibTeX
- Erik de Haas, Peter van Emde Boas:
Object Oriented Application Flow Graphs and their Semantics.
485-494 BibTeX
- Juraj Hromkovic, Jarkko Kari, Lila Kari:
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
495-505 BibTeX
- Louis Ibarra, Dana S. Richards:
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
506-516 BibTeX
- Oscar H. Ibarra, Nicholas Q. Trân:
On the Communication Complexity of Parallel Computation.
517-526 BibTeX
- Petr Jancar, Frantisek Mráz, Martin Plátek:
A Taxonomy of Forgetting Automata.
527-536 BibTeX
- Jifeng He:
Hybrid Parallel Programming and Implementation of Synchronised Communication.
537-546 BibTeX
- Astrid Kiehn:
Proof Systems for Cause Based Equivalences.
547-556 BibTeX
- Bruno Martin:
A Uniform Universal CREW PRAM.
557-565 BibTeX
- David Murphy:
Observing Located Concurrency.
566-576 BibTeX
- Philippe Narbel:
The Boundary of Substitution Systems.
577-587 BibTeX
- Jean Neraud:
New Algorithms for Detecting Morphic Images of a Word.
588-597 BibTeX
- Pawel Paczkowski:
Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent Programs.
598-607 BibTeX
- Michel Parigot, Paul Rozière:
Constant Time Reductions in Lambda-Caculus.
608-617 BibTeX
- Francesco Parisi-Presicce, S. Veglioni:
Heterogeneous Unified Algebras.
618-628 BibTeX
- Don Pigozzi, Antonino Salibra:
A Representation Theorem for Lambda Abstraction Algebras.
629-639 BibTeX
- Regimantas Pliuskevicius:
On Saturated Calculi for a Linear Temporal Logic.
640-649 BibTeX
- Hermann Puhlmann:
The Snack Powerdomain for Database Semantics.
650-659 BibTeX
- Bernhard Reus, Thomas Streicher:
Verifying Properties of Module Construction in Type Theory.
660-670 BibTeX
- Peter Ruzicka, Juraj Waczulík:
On Time-Space Trade-Offs in Dynamic Graph Pebbling.
671-681 BibTeX
- Vladimiro Sassone, Mogens Nielsen, Glynn Winskel:
Deterministic Behavioural Models for Concurrency.
682-692 BibTeX
- David Scholefield, Hussein S. M. Zedan, Jifeng He:
Real-Time Refinement: Semantics and Application.
693-702 BibTeX
- Bernhard Steffen, Carsten Weise:
Deciding Testing Equivalence for Real-Time Processes with Dense Time.
703-713 BibTeX
- Werner Stephan, Andreas Wolpers:
A Calculus for Higher Order Procedures with Global Variables.
714-723 BibTeX
- David Stevens:
Variable Substitution with Iconic Combinators.
724-733 BibTeX
- Ralf Treinen:
Feature Constraints with First-Class Features.
734-743 BibTeX
- Dorothea Wagner, Frank Wagner:
Between Min Cut and Graph Bisection.
744-750 BibTeX
- Egon Wanke:
Paths and Cycles in Finite Periodic Graphs.
751-760 BibTeX
- Jilei Yin, Zhu Hong:
Learning Decision Lists from Noisy Examples.
761-766 BibTeX
- Nicolas Zabel:
Analytic Tableaux for Finite and Infinite Post Logics.
767-776 BibTeX
Copyright © Sat May 16 23:29:33 2009
by Michael Ley (ley@uni-trier.de)