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

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

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.