Table of contents

  1. Front Matter
  2. Ricardo A. Baeza-Yates, Gaston H. Gonnet
    Pages 1-2
  3. Franco P. Preparata, Roberto Tamassia
    Pages 3-11
  4. Michael T. Goodrich, Colm Ó'Dúnlaing, Chee K. Yap
    Pages 12-23
  5. Walter Cunto, Gustavo Lau, Philippe Flajolet
    Pages 24-38
  6. Paul F. Dietz
    Pages 67-74
  7. Ricardo A. Baeza-Yates
    Pages 75-96
  8. Mikhail J. Atallah, Susanne E. Hambrusch
    Pages 97-114
  9. Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri
    Pages 115-134
  10. Yan Ke, Joseph O'Rourke
    Pages 135-146
  11. Matthew Díaz, Joseph O'Rourke
    Pages 171-182
  12. Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert
    Pages 183-191
  13. Fabrizio Luccio, Mireille Régnier, René Schott
    Pages 192-205
  14. Wojciech Szpankowski
    Pages 206-217
  15. Danièle Gardy, Philippe Flajolet, Claude Puech
    Pages 218-229

About these proceedings

Introduction

This book contains the papers presented at the 1989 Workshop on Algorithms and Data Structures, which succeeds the 1988 Scandinavian Workshop on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.

Keywords

Algorithmen Datenstrukturen Geometrische Algorithmen Graphentheorie Heapsort Komplexität algorithms complexity computational geometry data structures sorting

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-51542-9
  • Copyright Information Springer-Verlag 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-51542-5
  • Online ISBN 978-3-540-48237-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349