21. MFCS 1996:
Cracow,
Poland
Wojciech Penczek, Andrzej Szalas (Eds.):
Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings.
Lecture Notes in Computer Science 1113 Springer 1996, ISBN 3-540-61550-4 BibTeX
@proceedings{DBLP:conf/mfcs/1996,
editor = {Wojciech Penczek and
Andrzej Szalas},
title = {Mathematical Foundations of Computer Science 1996, 21st International
Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1113},
year = {1996},
isbn = {3-540-61550-4},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Papers
Contributed Papers
- Philippe Balbiani:
A Modal Logic for Data Analysis.
167-179 BibTeX
- Gabriel Baum, Marcelo F. Frias, Armando Martin Haeberer, Pablo E. Martínez López:
From Specifications to Programs: A Fork-Algebraic Approach to Bridge the Gap.
180-191 BibTeX
- Marek A. Bednarczyk:
Logic of Predicates with Explicit Substitutions.
192-205 BibTeX
- Richard Beigel, William I. Gasarch, Martin Kummer, Timothy McNicholl, Frank Stephan:
On the Query Complexity of Sets.
206-217 BibTeX
- Viviana Bono, Michele Bugliesi, Luigi Liquori:
A Lambda Calculus of Incomplete Objects.
218-229 BibTeX
- Michele Boreale, Luca Trevisan:
Bisimilarity Problems Requiring Exponential Time.
230-241 BibTeX
- Arie de Bruin, Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks Are Deterministic.
242-254 BibTeX
- X. Cai, Ton Kloks, C. K. Wong:
Shortest Path Problems with Time Constraints.
255-266 BibTeX
- Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski:
Parallel Alternating-Direction Access Machine.
267-278 BibTeX
- Flavio Corradini, Marco Pistore:
Specification and Verification of Timed Lazy Systems.
279-290 BibTeX
- Stéphane Demri:
A Class of Information Logics with a Decidable Validity Problem.
291-302 BibTeX
- Anders Dessmark, Andrzej Lingas:
On the Power of Nonconservative PRAM.
303-311 BibTeX
- Bruno Durand:
Self-Similarity Viewed as a Local Property via Tile Sets.
312-323 BibTeX
- Kai Engelhardt, Willem P. de Roever:
Simulation of Specification Statements in Hoare Logic.
324-335 BibTeX
- Zoltán Ésik, Anna Labella:
Equational Properties of Iteration in Algebraically Complete Categories.
336-347 BibTeX
- Henning Fernau:
On Unconditional Transfer.
348-359 BibTeX
- Dimitris Fotakis, Paul G. Spirakis:
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP.
360-371 BibTeX
- Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
372-381 BibTeX
- Ian Glaister, Jeffrey Shallit:
Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract).
382-393 BibTeX
- Ursula Goltz, Heike Wehrheim:
Causal Testing.
394-406 BibTeX
- Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi:
Construction of List Homomorphisms by Tupling and Fusion.
407-418 BibTeX
- Marta Z. Kwiatkowska, Gethin Norman:
Probabilistic Metric Semantics for a Simple Language with Recursion.
419-430 BibTeX
- Andrea Maggiolo-Schettini, Józef Winkowski:
Dynamic Graphs.
431-442 BibTeX
- Sabrina Mantaci, Antonio Restivo:
Equations on Trees.
443-456 BibTeX
- Enno Ohlebusch, Esko Ukkonen:
On the Equivalence Problem for E-Pattern Languages.
457-468 BibTeX
- Wieslaw Pawlowski, Pawel Paczkowski, Stefan Sokolowski:
Specifying and Verifying Parametric Processes.
469-481 BibTeX
- Regimantas Pliuskevicius:
On Saturation with Flexible Function Symbols.
482-493 BibTeX
- Carsten Rössner, Jean-Pierre Seifert:
Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard.
494-505 BibTeX
- Patrice Séébold:
On the Conjugation of Standard Morphisms.
506-516 BibTeX
- Hui Shi:
A Semantic Matching Algorithm: Analysis and Implementation.
517-528 BibTeX
- Jop F. Sibeyn:
Routing on Triangles, Tori and Honeycombs.
529-541 BibTeX
- Pilar de la Torre, David T. Kao:
A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries.
542-553 BibTeX
- Axel Wabenhorst:
On Fairness in Terminating and Reactive Programs.
554-565 BibTeX
- Tomoyuki Yamakami:
Polynomial Time Samplable Distributions.
566-578 BibTeX
- Elena Zucca:
From Static to Dynamic Abstract Data-Types.
579-590 BibTeX
Copyright © Sat May 16 23:29:34 2009
by Michael Ley (ley@uni-trier.de)
