Editors:
Future prospects in algorithm research
Growth of and advances in space efficient data structures
Sorting and searching in data structures
Part of the book series: Theoretical Computer Science and General Issues (LNTCS, volume 8066)
Buying options
This is a preview of subscription content, access via your institution.
Table of contents (22 chapters)
-
Front Matter
About this book
Keywords
- adaptive algorithms
- document retrieval
- permutation
- sorting
- unbounded search
- algorithm analysis and problem complexity
- data structures
Editors and Affiliations
-
Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia
Andrej Brodnik
-
Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada
Alejandro López-Ortiz
-
The Institute of Mathematical Sciences, Chennai, India
Venkatesh Raman
-
Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
Alfredo Viola
Bibliographic Information
Book Title: Space-Efficient Data Structures, Streams, and Algorithms
Book Subtitle: Papers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday
Editors: Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola
Series Title: Theoretical Computer Science and General Issues
DOI: https://doi.org/10.1007/978-3-642-40273-9
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2013
Softcover ISBN: 978-3-642-40272-2Published: 07 August 2013
eBook ISBN: 978-3-642-40273-9Published: 13 August 2013
Series ISSN: 2512-2010
Series E-ISSN: 2512-2029
Edition Number: 1
Number of Pages: XXVIII, 363
Number of Illustrations: 58 b/w illustrations
Topics: Algorithms, Data Science, Discrete Mathematics in Computer Science, Computer Graphics, Numerical Analysis, Computer Communication Networks