Skip to main content
  • Conference proceedings
  • © 2003

Algorithms and Data Structures

8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings

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

Conference series link(s): WADS: Algorithms and Data Structures Symposium

Conference proceedings info: WADS 2003.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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 (44 papers)

  1. Front Matter

  2. Multi-party Pseudo-Telepathy

    • Gilles Brassard, Anne Broadbent, Alain Tapp
    Pages 1-11
  3. Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips

    • Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Pages 12-24
  4. Shape Segmentation and Matching with Flow Discretization

    • Tamal K. Dey, Joachim Giesen, Samrat Goswami
    Pages 25-36
  5. Toward Optimal Motif Enumeration

    • Patricia A. Evans, Andrew D. Smith
    Pages 47-58
  6. Common-Deadline Lazy Bureaucrat Scheduling Problems

    • Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi
    Pages 59-66
  7. Bandwidth-Constrained Allocation in Grid Computing

    • Anshul Kothari, Subhash Suri, Yunhong Zhou
    Pages 67-78
  8. Fast Algorithms for a Class of Temporal Range Queries

    • Qingmin Shi, Joseph JaJa
    Pages 91-102
  9. Distribution-Sensitive Binomial Queues

    • Amr Elmasry
    Pages 103-113
  10. Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees

    • Gianni Franceschini, Roberto Grossi
    Pages 114-126
  11. Extremal Configurations and Levels in Pseudoline Arrangements

    • Micha Sharir, Shakhar Smorodinsky
    Pages 127-139
  12. The One-Round Voronoi Game Replayed

    • Sándor P. Fekete, Henk Meijer
    Pages 150-161
  13. Integrated Prefetching and Caching with Read and Write Requests

    • Susanne Albers, Markus Büttner
    Pages 162-173
  14. Online Seat Reservations via Offline Seating Arrangements

    • Jens S. Frederiksen, Kim S. Larsen
    Pages 174-185
  15. Routing and Call Control Algorithms for Ring Networks

    • R. Sai Anand, Thomas Erlebach
    Pages 186-197
  16. Algorithms and Models for Railway Optimization

    • Dorothea Wagner
    Pages 198-206
  17. Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles

    • Matthias Müller-Hannemann, Sven Peyer
    Pages 207-218

Other Volumes

  1. Algorithms and Data Structures

Editors and Affiliations

  • Carleton University, Ottawa, Canada

    Frank Dehne

  • School of Computer Science, Carleton University, Ottawa, Canada

    Jörg-Rüdiger Sack, Michiel Smid

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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