Table of contents

  1. Front Matter
  2. Mikhail J. Atallah, Danny Z. Chen
    Pages 1-13
  3. Richard M. Karp
    Pages 27-34
  4. Andrew C. Yao
    Pages 35-35
  5. Pankaj K. Agarwal, Marc van Kreveld
    Pages 36-47
  6. Arne Andersson
    Pages 60-71
  7. Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport
    Pages 72-82
  8. Lars Arge, Mikael Knudsen, Kirsten Larsen
    Pages 83-94
  9. Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David Mount, Christine D. Piatko, Steven S. Skiena
    Pages 95-106
  10. Deganit Armon, John Reif
    Pages 107-118
  11. Yossi Azar, Bala Kalyanasundaram, Serge Plotkin, Kirk R. Pruhs, Orli Waarts
    Pages 119-130
  12. Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan
    Pages 131-141
  13. R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
    Pages 142-150
  14. Paul Beame, Faith E. Fich, Rakesh K. Sinha
    Pages 163-174
  15. Marshall Bern, David Eppstein, Shang-Hua Teng
    Pages 188-199

About these proceedings


The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers.


Algorithmen Algorithms Combinatorics Complexity Theory Datenstrukturen Graph Theory Kombinatorik Komplexitätstheorie algorithm complexity data structure data structures

Bibliographic information