Table of contents

  1. Front Matter
  2. Costas S. Iliopoulos, W. F. Smyth
    Pages 25-32
  3. Vijaya Ramachandran
    Pages 33-40
  4. T. S. Papatheodorou, N. B. Tsantanis
    Pages 41-47
  5. Sam Kim, Robert McNaughton, Robert McCloskey
    Pages 48-65
  6. Michel Cosnard, Mostafa El Daoudi, Yves Robert
    Pages 86-105
  7. Arne Andersson
    Pages 106-114
  8. B. John Oommen, David T. H. Ng
    Pages 115-125
  9. L. G. Aleksandrov, H. N. Djidjev
    Pages 126-138
  10. Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani
    Pages 139-152
  11. Doron Nussbaum, Jörg-R. Sack
    Pages 153-167
  12. Gautam Das, Deborah Joseph
    Pages 168-192
  13. Maria Serna, Paul Spirakis
    Pages 193-204
  14. Danilo Bruschi, Deborah Joseph, Paul Young
    Pages 205-231
  15. Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    Pages 239-253

About these proceedings

Introduction

This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and complexity of algorithms. Some of the invited papers include surveys of results in particular fields and some report original research, while all the contributed papers report original research. Most of the algorithms given are for parallel models of computation. The papers were presented at the Second International Symposium on Optimal Algorithms held in Varna, Bulgaria, in May/June 1989. The volume will be useful to researchers and students in theoretical computer science, especially in parallel computing.

Keywords

Equivalence Finite Geometrische Algorithmen Graphenalgorithmen Komplexität von Algorithmen Parallele Algrithmen Probabilistisches Rechnen algorithm algorithms automata complexity data structure geometry optimization

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-51859-2
  • Copyright Information Springer-Verlag 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-51859-4
  • Online ISBN 978-3-540-46831-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book