Advanced Data Structures

AvPeter Brass

Häftad, Engelska, 2019

681 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

1 168 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2019-05-16
Mått:152 x 230 x 24 mm
Vikt:1 100 g
Format:Häftad
Språk:Engelska
Antal sidor:474
Förlag:Cambridge University Press
ISBN:9781108735513

Utforska kategorier

Programmeringsböcker inom Data och IT

Mer om författaren

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.

Recensioner i media

'I think this book is well suited as a main or supplemental text in a graduate-level data structures course, not to mention an invaluable desk reference for those interested in implementing the advance structures outlined in this book. This book was a joy to review, and deserves a place on my bookshelf.' SIGACT News

Innehållsförteckning

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.