Table of contents

  1. Front Matter
  2. Ming Li, Paul M. B. Vitányi
    Pages 1-15
  3. Alfredo De Santis, Giuseppe Persiano, Moti Yung
    Pages 28-40
  4. Veikko Keränen
    Pages 41-52
  5. Juhani Karhumaäki, Wojciech Plandowski, Wojciech Rytter
    Pages 53-64
  6. Taishin Y. Nishida
    Pages 65-76
  7. Gerhard Buntrock, Krzysztof Loryś
    Pages 77-88
  8. M. Clerbout, M. Latteux, Y. Roos, W. Zielonka
    Pages 113-125
  9. Oscar H. Ibarra, Nicholas Q. Trân
    Pages 126-137
  10. Pierre Péladeau, Andreas Podelski
    Pages 150-161
  11. V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk et al.
    Pages 162-173
  12. Ming-Jye Sheu, Timothy J. Long
    Pages 174-185
  13. Philippe Flajolet
    Pages 186-210
  14. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
    Pages 211-222
  15. M. Dietzfelbinger, J. Gil, Y. Matias, N. Pippenger
    Pages 235-246

About these proceedings

Introduction

This volume presents the proceedings of the 19th International Colloquium onAutomata, Languages, and Programming (ICALP 92) in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP is a broadly based conference covering all aspects of theoretical computer science, including such topics as computability, automata, formal languages, term rewriting, analysis of algorithms, computational geometry, computational complexity, symbolic and algebraic computation, cryptography, data types and data structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design andlayout, parallel and distributed computation, theory of concurrency, and theory of robotics. The papers in the volume are grouped into thematic parts corresponding to their order of presentation at ICALP 92.

Keywords

Automat Graph Symbol algorithms automata complexity computability concurrency formal language linear optimization logic programming language theoretical computer science verification

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-55719-9
  • Copyright Information Springer-Verlag 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-55719-7
  • Online ISBN 978-3-540-47278-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book