20. ICALP 1993:
Lund,
Sweden
Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson (Eds.):
Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings.
Lecture Notes in Computer Science 700 Springer 1993, ISBN 3-540-56939-1 BibTeX
@proceedings{DBLP:conf/icalp/1993,
editor = {Andrzej Lingas and
Rolf G. Karlsson and
Svante Carlsson},
title = {Automata, Languages and Programming, 20nd International Colloquium,
ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings},
booktitle = {ICALP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {700},
year = {1993},
isbn = {3-540-56939-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Programs and Data Structures
Approximation Complexity
Graph Algorithms
Algorithm Analysis and Computational Geometry
Complexity
Probabilistic Complexity and Cryptography
Computability,
Formal Languages and Automata
- David W. Juedes, James I. Lathrop, Jack H. Lutz:
Computational Depth and Reducibility (Extended Abstract).
277-288 BibTeX
- Ganesh Baliga, John Case:
Learnability: Admissible, Co-finite, and Hypersimple Languages.
289-300 BibTeX
- Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu:
Inclusion is Undecidable for Pattern Languages.
301-312 BibTeX
- Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang:
New Decidability Results Concerning Two-way Counter Machines and Applications.
313-324 BibTeX
Logic,
Formal Languages and Automata
Parallel and Distributed Algorithms I
Parallel and Distributed Algorithms II
Algebraic Aspects of Formal Languages and Automata I
Algebraic Aspects of Formal Languages and Automata II
Concurrency
Temporal Logic
Theory of Programming I
Theory of Programming II
Copyright © Wed Aug 20 20:00:37 2008
by Michael Ley (ley@uni-trier.de)
