Automata, Languages and Programming

1. On the distributional complexity of disjointness

   • A. A. Razborov

   Pages 249-253

2. Computing boolean functions on anonymous networks

   • Evangelos Kranakis, Danny Krizanc, Jacob van den Berg

   Pages 254-267

3. On the composition of zero-knowledge proof systems

   • Oded Goldreich, Hugo Krawczyk

   Pages 268-282

4. Additional queries to random and pseudorandom oracles

   • Ronald V. Book, Jack H. Lutz, Shouwen Tang

   Pages 283-293

5. Communication among relations

   • A. Rabinovich, B. A. Trakhtenbrot

   Pages 294-307

6. Stability and sequentiality in dataflow networks

   • Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark

   Pages 308-321

7. Automata for modeling real-time systems

   • Rajeev Alur, David Dill

   Pages 322-335

8. Markov decision processes and regular events

   • Costas Courcoubetis, Mihalis Yannakakis

   Pages 336-349

9. Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond

   • Jan Willem Klop

   Pages 350-369

10. Nonoblivious normalization algorithms for nonlinear rewrite systems

    • Rakesh M. Verma, I. V. Ramakrishnan

    Pages 370-385

11. Algebraic properties of idempotent substitutions

    • Catuscia Palamidessi

    Pages 386-399

12. Determining the separation of preprocessed polyhedra — A unified approach

    • David P. Dobkin, David G. Kirkpatrick

    Pages 400-413

13. Randomized incremental construction of delaunay and Voronoi diagrams

    • Leonidas J. Guibas, Donald E. Knuth, Micha Sharir

    Pages 414-431

14. Merging free trees in parallel for efficient voronoi diagram construction

    • Richard Cole, Michael T. Goodrich, Colm Ó Dúnlaing

    Pages 432-445

15. Local optimization and the Traveling Salesman Problem

    • David S. Johnson

    Pages 446-461

16. Polynomial-time approximation algorithms for the ising model

    • Mark Jerrum, Alistair Sinclair

    Pages 462-475

17. On parallelizing graph-partitioning heuristics

    • John E. Savage, Markus G. Wloka

    Pages 476-489

18. Iterated substitutions and locally catenative systems: a decidability result in the binary case

    • Christian Choffrut

    Pages 490-500

19. Decomposition of partial commutations

    • Mireille Clerbout, Michel Latteux, Yves Roos

    Pages 501-511

20. Boolean closure and unambiguity of rational sets

    • Maryse Pelletier

    Pages 512-525

This volume contains the proceedings of ICALP 90, the International Colloquium on Automata, Languages and Programming sponsored by the European Association for Theoretical Computer Science (EATCS). This annual conference series covers all important areas of theoretical computer science, such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic 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. This volume contains five invited papers and 52 papers selected from 250 submitted.

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

Policies and ethics