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
Programs and Data Structures
Approximation Complexity
Graph Algorithms
Algorithm Analysis and Computational Geometry
Complexity
- Lane A. Hemachandra:
Fault-Tolerance and Complexity (Extended Abstract).
189-202

- Hiroaki Yamamoto:
Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines.
203-214

- Pekka Orponen:
On the Computational Power of Discrete Hopfield Nets.
215-226

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

- Ganesh Baliga, John Case:
Learnability: Admissible, Co-finite, and Hypersimple Languages.
289-300

- Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu:
Inclusion is Undecidable for Pattern Languages.
301-312

- Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang:
New Decidability Results Concerning Two-way Counter Machines and Applications.
313-324

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
Last update Mon May 20 14:51:10 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page