Table of contents

  1. Front Matter
  2. Robin Milner
    Pages 1-1
  3. Christos H. Papadimitriou
    Pages 2-6
  4. Kurt Mehlhorn, Stefan Näher, Christian Uhrig
    Pages 7-16
  5. Olivier Carton, Dominique Perrin
    Pages 17-35
  6. Laura F. Landweber, Richard J. Lipton
    Pages 56-64
  7. Bruno Durand
    Pages 65-75
  8. Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
    Pages 76-86
  9. Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi
    Pages 98-109
  10. Martin Beaudry, François Lemieux, Denis Thérien
    Pages 110-120
  11. Pietro Di Gianantonio
    Pages 121-131
  12. James I. Lathrop, Jack H. Lutz
    Pages 132-142
  13. Yuri Gurevich, Andrei Voronkov
    Pages 154-165
  14. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Pages 177-187
  15. Harry Buhrman, Stephen Fenner, Lance Fortnow
    Pages 188-194

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 24th International Colloquium on Automata, Languages and Programming, ICALP '97, held in Bologna, Italy, in July 1997. ICALP '97 celebrated the 25th anniversary of the European Association for Theoretical Computer Science (EATCS), which has sponsored the ICALP meetings since 1972.
The volume presents 73 revised full papers selected from a total of 197 submissions. Also included are six invited contributions. ICALP is one of the few flagship conferences in the area. The book addresses all current topics in theoretical computer science.

Keywords

Algorithmen Constraint FlagShip Formale Sprachen Komplexität Nebenläufigkeit Partition Programmsemantik algorithms calculus complexity computability geometry logic sets

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-63165-8
  • Copyright Information Springer-Verlag 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-63165-1
  • Online ISBN 978-3-540-69194-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book