Advanced Data Structures

Erscheinungsjahr 2019
ISBN: 978-1-108-73551-3
Verlag: Cambridge University Press

Buch, Englisch, 472 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 681 g

This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: 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. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.

Autoren/Hrsg.

Brass, Peter

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen

Inhaltsverzeichnis

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.

Über Autor(innen)

Brass, Peter
Peter Brass received a Ph.D. in mathematics at the Technical University of Braunschweig, Germany. He is an associate professor at City College, City University of New York in the Department of Computer Science and a former Heisenberg Research Fellow at Freie Universität Berlin.