Table of contents

  1. Front Matter
  2. Samir Khuller, Robert Pless, Yoram J. Sussmann
    Pages 37-48
  3. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Pages 49-60
  4. Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
    Pages 61-73
  5. Uriel Feige, Giora Rayzman
    Pages 74-85
  6. Francisco Gómez, Suneeta Ramaswami, Godfried Toussaint
    Pages 86-99
  7. Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo
    Pages 100-109
  8. Amitava Datta, Kamala Krithivasan, Thomas Ottmann
    Pages 110-121
  9. Ulrich Fößmeier, Michael Kaufmann
    Pages 122-134
  10. G. Liotta, R. Tamassia, I. G. Tollis, P. Vocca
    Pages 135-146
  11. Fabrizio Luccio, Alberto Pedrotti
    Pages 147-158
  12. Paolo Ferragina, Roberto Grossi, Manuela Montangero
    Pages 181-192
  13. S. Hanke, Th. Ottmann, E. Soisalon-Soininen
    Pages 193-204
  14. Jyrki Katajainen, Jesper Larsson Träff
    Pages 217-228
  15. Jop F. Sibeyn, Michael Kaufmann
    Pages 229-240
  16. Gianpiero Cattaneo, Michele Finelli, Luciano Margara
    Pages 241-252
  17. Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
    Pages 264-275
  18. Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
    Pages 276-287
  19. Paola Alimonti, Viggo Kann
    Pages 288-298
  20. Ming-Yang Kao
    Pages 299-310
  21. Back Matter

About these proceedings


This book constitutes the refereed proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC'97, held in Rome, Italy in March 1997.
The 25 revised full papers included in the volume were carefully selected from a total of 74 submissions; also included is an invited paper and an invited abstract. All in all, the papers present an interesting snapshot of current research activities and recent results in theory and applications of sequential, distributed, and parallel algorithms, data structures, and computational complexity.


Algorithmenkomplexität Datenstrukturen Sequentielle Algorithmen algorithm algorithms complexity computational complexity data structure data structures distributed algorithms parallel algorithms sequential algorithms

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-62592-6
  • Online ISBN 978-3-540-68323-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
IT & Software
Consumer Packaged Goods