Advanced Data Structures available in Hardcover
Advanced Data Structures presents a comprehensive look at the ideas, analysis, and implementation details of data structures as a specialized topic in applied algorithms. Data structures are how data is stored within a computer, and how one can go about searching for data within. This text examines efficient ways to search and update sets of numbers, intervals, or strings by various data structures, such as search trees, structures for sets of intervals or piece-wise constant functions, orthogonal range search structures, heaps, union-find structures, dynamization and persistence of structures, structures for strings, and hash tables. This is the first volume to show data structures as a crucial algorithmic topic, rather than relegating them as trivial material used to illustrate object-oriented programming methodology, filling a void in the ever-increasing computer science market. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text. topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.
|Publisher:||Cambridge University Press|
|Edition description:||New Edition|
|Product dimensions:||6.20(w) x 9.00(h) x 1.20(d)|
About the Author
Peter Brass received a Ph.D. in mathematics at the Technical University of Braunschweig, Germany. He is an associate professor at the City College of New York in the Department of Computer Science and a former Heisenberg Research Fellow at the Free University of Berlin.
Table of Contents
1. Elementary structures; 2. Search types; 3. Balanced search trees; 4. Tree structures for sets of intervals; 5. Heaps; 6. Union-find and related structures; 7. Data structure transformations; 8. Data structures for strings; 9. Hash tables; 10. Appendix.