Skip to main content Accessibility help
×
  • Cited by 46
      • Peter Brass, City College, City University of New York
      Show more authors
    • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      January 2011
      September 2008
      ISBN:
      9780511800191
      9780521880374
      9781108735513
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.75kg, 474 Pages
      Dimensions:
      (229 x 152 mm)
      Weight & Pages:
      1.1kg, 474 Pages
    You may already have access via personal or institutional login
  • Selected: Digital
    Add to cart View cart Buy from Cambridge.org

    Book description

    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.

    Reviews

    '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.'

    Source: SIGACT News

    '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 Source: Software Engineering Notes

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    ×

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.