Advanced Data Structures
- Author: Peter Brass, City College, City University of New York
- Date Published: November 2008
- availability: Available
- format: Hardback
- isbn: 9780521880374
Hardback
Other available formats:
Paperback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- This is the only graduate-level textbook on data structures
- Contains discussion of numerous structures with their analysis, code examples, implementation details, and in most cases a complete implementation on author homepage
- Contains detailed history for each structure with more than 500 references
Reviews & endorsements
'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
See more reviews'It can be briefly said that the reader will be dealing with an illustration, diagram, and code packed book, that will do it's best not to confuse but to very well explain one of the toughest computer science subjects, and he will be pleasantly surprised to learn many new-age data structures.' Igor Gvero, Software Engineering Notes
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: November 2008
- format: Hardback
- isbn: 9780521880374
- length: 474 pages
- dimensions: 229 x 152 x 28 mm
- weight: 0.75kg
- availability: Available
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.Instructors have used or reviewed this title for the following courses
- Advanced Algorithms
- Advanced Data Structures
- Advanced Database Systems
- Advanced data structures and algorithms
- Algorithms
- Algorithms and data structures
- Data Structures
- Data Structures and Analysis
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×