Skip to main content
  • Conference proceedings
  • © 1997

Algorithms and Complexity

Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1203)

Conference series link(s): CIAC: International Conference on Algorithms and Complexity

Conference proceedings info: CIAC 1997.

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (27 papers)

  1. Front Matter

  2. Fault tolerant K-center problems

    • Samir Khuller, Robert Pless, Yoram J. Sussmann
    Pages 37-48
  3. R SN1−tt (NP) distinguishes robust many-one and Turing completeness

    • Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Pages 49-60
  4. Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy

    • Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
    Pages 61-73
  5. On the drift of short schedules

    • Uriel Feige, Giora Rayzman
    Pages 74-85
  6. On removing non-degeneracy assumptions in computational geometry

    • Francisco Gómez, Suneeta Ramaswami, Godfried Toussaint
    Pages 86-99
  7. Maintaining maxima under boundary updates

    • Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo
    Pages 100-109
  8. An optimal algorithm for one-separation of a set of isothetic polygons

    • Amitava Datta, Kamala Krithivasan, Thomas Ottmann
    Pages 110-121
  9. Nice drawings for planar bipartite graphs

    • Ulrich Fößmeier, Michael Kaufmann
    Pages 122-134
  10. Area requirement of Gabriel drawings (extended abstract)

    • G. Liotta, R. Tamassia, I. G. Tollis, P. Vocca
    Pages 135-146
  11. Design of reliable combinatorial algorithms using certificates

    • Fabrizio Luccio, Alberto Pedrotti
    Pages 147-158
  12. A note on updating suffix tree labels

    • Paolo Ferragina, Roberto Grossi, Manuela Montangero
    Pages 181-192
  13. Relaxed balanced red-black trees

    • S. Hanke, Th. Ottmann, E. Soisalon-Soininen
    Pages 193-204

Other Volumes

  1. Algorithms and Complexity

About this book

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.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access