Automata, Languages and Programming

1. Canonical sets of horn clauses

   • Nachum Dershowitz

   Pages 267-278

2. A specialized completion procedure for monadic string-rewriting systems presenting groups

   • K. Madlener, P. Narendran, F. Otto

   Pages 279-290

3. A confluent reduction for the λ-calculus with surjective pairing and terminal object

   • Pierre-Louis Curien, Roberto Di Cosmo

   Pages 291-302

4. Provably recursive programs and program extraction

   • Tim Fernando

   Pages 303-313

5. Efficient algorithms for path problems with general cost criteria

   • T. Lengauer, D. Theune

   Pages 314-326

6. Computing shortest paths and distances in planar graphs

   • Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis

   Pages 327-338

7. Maintaining biconnected components of dynamic planar graphs

   • Zvi Galil, Giuseppe F. Italiano

   Pages 339-350

8. Efficient maximal cubic graph cuts

   • Martin Loebl

   Pages 351-362

9. Structural parallel algorithmics

   • Uzi Vishkin

   Pages 363-380

10. Improving known solutions is hard

    • Desh Ranjan, Suresh Chari, Pankaj Rohatgi

    Pages 381-392

11. Collapsing degrees via strong computation

    • Lane A. Hemachandra, Albrecht Hoene

    Pages 393-404

12. Fast parallel generation of random permutations

    • Torben Hagerup

    Pages 405-416

13. A parallel algorithm for two processors precedence constraint scheduling

    • Hermann Jung, Maria Serna, Paul Spirakis

    Pages 417-428

14. An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs

    • Martin Fürer, Balaji Raghavachari

    Pages 429-440

15. On logics, tilings, and automata

    • Wolfgang Thomas

    Pages 441-454

16. Satisfiability of systems of ordinal notations with the subterm property is decidable

    • Jean-Pierre Jouannaud, Mitsuhiro Okada

    Pages 455-468

17. Complete axiomatizations of some quotient term algebras

    • Hubert Comon

    Pages 469-480

18. The meaning of negative premises in transition system specifications

    • Roland Bol, Jan Friso Groote

    Pages 481-494

19. Deciding history preserving bisimilarity

    • Walter Vogler

    Pages 495-505

20. Adding action refinement to a finite process algebra

    • Luca Aceto, Matthew Hennessy

    Pages 506-519

This volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP stands for International Colloquium on Automata, Languages, and Programming, and this conference series covers all important areas of theoretical computer science, such as: computability, automata, formal languages, data types and structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic and functional programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics.

• Automat
• Layout
• automata
• computer science
• database
• formal language
• formal languages
• knowledge base
• programming
• programming language
• robot
• robotics
• semantics
• term rewriting
• verification
• data structures
• combinatorics
• algorithm analysis and problem complexity

Policies and ethics