Read While You Wait - Get immediate ebook access, if available*, when you order a print book

Lecture Notes in Computer Science

CAAP '88

13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21-24, 1988. Proceedings

Editors: Dauchet, Max, Nivat, Maurice (Eds.)

Free Preview

Buy this book

eBook $74.99
price for USA in USD
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-38930-9
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-3-540-19021-9
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually ready to be dispatched within 3 to 5 business days.
About this book

This volume contains the proceedings of the 13th Colloquium on Trees in Algebra and Programming (CAAP '88), held in Nancy, March 21-24, 1988. The preceding 12 colloquia were held in France, Italy and Germany. CAAP '85 and CAAP '87 were integrated into the International Joint Conference on Theory and Practice of Software Development, TAPSOFT (see Lecture Notes in Computer Science volumes 185 and 249). As another effort to link theory and practice in computer science, CAAP '88 was held in conjunction with the European Symposium on Programming, ESOP '88 (see volume 300 of this Lecture Notes series). CAAP '88 is a conference in the area of program development and programming concepts but, following the tradition, is devoted to theoretical aspects, and especially to Trees, a basic structure of computer science. A wider range of topics in theoretical computer science is also covered. The papers are on word, tree or graph languages, with algorithmic or complexity studies, on abstract data types (another classical topic of CAAP) and/or term rewriting systems and on non-standard logics, and parallelism and concurrency.

Table of contents (20 chapters)

Table of contents (20 chapters)
  • A tree pattern matching algorithm with reasonable space requirements

    Pages 1-15

    Burghardt, Jochen

  • On the maximum path length of AVL trees

    Pages 16-27

    Klein, Rolf (et al.)

  • Decomposition trees: Structured graph representation and efficient algorithms

    Pages 28-39

    Lautemann, Clemens

  • On counting and approximation

    Pages 40-51

    Köbler, Johannes (et al.)

  • Parameter-reduction of higher level grammars

    Pages 52-71

    Seidl, Helmut

Buy this book

eBook $74.99
price for USA in USD
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-38930-9
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-3-540-19021-9
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually ready to be dispatched within 3 to 5 business days.
Loading...

Services for this Book

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
CAAP '88
Book Subtitle
13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21-24, 1988. Proceedings
Editors
  • Max Dauchet
  • Maurice Nivat
Series Title
Lecture Notes in Computer Science
Series Volume
299
Copyright
1988
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-38930-9
DOI
10.1007/BFb0026091
Softcover ISBN
978-3-540-19021-9
Series ISSN
0302-9743
Edition Number
1
Number of Pages
VIII, 305
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works and instructor copies are not included.