Algorithms and Data Structures : Third Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings

Frank Dehne

ISBN 10: 3540571558 / ISBN 13: 9783540571551

Published by Springer Berlin Heidelberg, 1993

About this Item

Druck auf Anfrage Neuware - Printed after ordering - The papers in this volume were presented at the ThirdWorkshop on Algorithmsand Data Structures (WADS '93), heldin Montreal, Canada, August 1993.The volume opens with five invited presentations: 'Computingthe all-pairs longest chains in the plane' by M.J. Atallahand D.Z. Chen, 'Towards a better understanding of purepacket routing' by A. Borodin, 'Tolerating faults in meshesand other networks' (abstract) by R. Cole, 'A generalizationof binary search' by R.M. Karp, and 'Groups and algebraiccomplexity' (abstract) by A.C. Yao. The volume continueswith 52 regular presentations selected from 165 submissions,each of which was evaluated by at least three programcommittee members, many of whom called upon additionalreviewers.

Seller Inventory # 9783540571551

Bibliographic Details

• Title: Algorithms and Data Structures : Third Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings
• Publisher: Springer Berlin Heidelberg
• Publication Date: 1993
• Language: English
• ISBN 10: 3540571558
• ISBN 13: 9783540571551
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

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.