Algorithms and Data Structures [electronic resource] : 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings / edited by Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack.Material type: TextLanguage: English Series: Lecture Notes in Computer Science: 8037Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013Description: XIV, 538 p. 132 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642401046Subject(s): Computer science | Computer Communication Networks | Data structures (Computer science) | Computer software | Electronic data processing | Computational complexity | Computer graphics | Computer Science | Algorithm Analysis and Problem Complexity | Data Structures | Discrete Mathematics in Computer Science | Computer Graphics | Numeric Computing | Computer Communication NetworksAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
Algorithms and data structures in bioinformatics -- Algorithms and data structures in combinatorics -- Algorithms and data structures in computational geometry -- Algorithms and data structures in databases -- Algorithms and data structures in graphics -- Parallel and distributed computing.
This book constitutes the refereed proceedings of the 13th Algorithms and Data Structures Symposium, WADS 2013, held in London, ON, Canada, August 2013. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 44 revised full papers presented in this volume were carefully reviewed and selected from 139 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.