Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1991

Algorithms and Data Structures

2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings

Editors:

  1. Frank Dehne
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jörg-Rüdiger Sack
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Nicola Santoro
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Sections

Buy it now

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 (43 papers)

  1. Front Matter

    PDF

  2. A case study in comparison based complexity: Finding the nearest value(s)

    • Walter Cunto, J. Ian Munro, Patricio V. Poblete
    Pages 1-12

  3. On the zone of a surface in a hyperplane arrangement

    • Boris Aronov, Micha Sharir
    Pages 13-19

  5. Finding level-ancestors in dynamic trees

    • Paul F. Dietz
    Pages 32-40

  6. Treewidth of circular-arc graphs+

    • Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
    Pages 41-41

  7. Fully dynamic delaunay triangulation in logarithmic expected time per operation

    • Olivier Devillers, Stefan Meiser, Monique Teillaud
    Pages 42-53

  8. On computing the voronoi diagram for restricted planar figures

    • Hristo Djidjev, Andrzej Lingas
    Pages 54-64

  9. The MINSUMCUT problem

    • J. Díaz, A. M. Gibbons, M. S. Paterson, J. Torán
    Pages 65-79

  10. Efficient algorithms for the minimum range cut problems

    • Naoki Katoh, Kazuo Iwano
    Pages 80-91

  12. Farthest neighbors, maximum spanning trees and related problems in higher dimensions

    • Pankaj K. Agarwal, Jiří Matoušek, Subhash Suri
    Pages 105-116

  14. Sharing memory in asynchronous message passing systems

    • Oscar R. Aguilar, Ajoy Kumar Datta, Sukumar Ghosh
    Pages 129-140

  15. A linear-time scheme for version reconstruction

    • Lin Yu, Daniel J. Rosenkrantz
    Pages 141-152

  17. Geometric knapsack problems

    • Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell
    Pages 165-176

  19. Unstructured path problems and the making of semirings

    • T. Lengauer, D. Theune
    Pages 189-200
Back to top

About this book

This volume presents the proceedings of the Second Workshop on Algorithms and Data Structures (WADS '91), held at Carleton University in Ottawa. The workshop was organized by the School of Computer Science at Carleton University. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 were selected for presentation at the workshop. In addition, there were 5 invited presentations.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation