Handbook of Data Structures and Applications
Home > Computing and Information Technology > Computer science > Human–computer interaction > Information architecture > Handbook of Data Structures and Applications
Handbook of Data Structures and Applications

Handbook of Data Structures and Applications

|
     0     
5
4
3
2
1




International Edition


About the Book

The Handbook of Data Structures and Applications was first published over a decade ago. This second edition aims to update the first by focusing on areas of research in data structures that have seen significant progress. While the discipline of data structures has not matured as rapidly as other areas of computer science, the book aims to update those areas that have seen advances. Retaining the seven-part structure of the first edition, the handbook begins with a review of introductory material, followed by a discussion of well-known classes of data structures, Priority Queues, Dictionary Structures, and Multidimensional structures. The editors next analyze miscellaneous data structures, which are well-known structures that elude easy classification. The book then addresses mechanisms and tools that were developed to facilitate the use of data structures in real programs. It concludes with an examination of the applications of data structures. Four new chapters have been added on Bloom Filters, Binary Decision Diagrams, Data Structures for Cheminformatics, and Data Structures for Big Data Stores, and updates have been made to other chapters that appeared in the first edition. The Handbook is invaluable for suggesting new ideas for research in data structures, and for revealing application contexts in which they can be deployed. Practitioners devising algorithms will gain insight into organizing data, allowing them to solve algorithmic problems more efficiently.

Table of Contents:
Part 1: Introduction 1. Analysis of Algorithms 2. Basic Structures 3. Trees 4. Graphs Part 2: Priority Queues 5. Leftist Trees 6. Skew Heaps 7. Binomial, Fibonacci,and Pairing Heaps 8. Double-Ended Priority Queues Part 3: Dictionary Structures 9. Hash Tables 10. Bloom Filter and Its Variants 11. Balanced Binary Search Trees 12. Finger Search Trees 13. Splay Trees 14. Randomized Dictionary Structures 15. Trees with Minimum Weighted Path Length 16. B Trees Part 4: Multidimensional/Spatial Structures 17. Multidimensional Spatial Data Structs 18. Planar Straight Line Graphs 19. Interval, Segment, Range, and Priority Search Trees 20. Quadtrees and Octrees 21. Binary Space Partitioning Trees 22. R-trees 23. Multidimensional and Spatial Structures 24. Kinetic Data Structures 25. Online Dictionary Structures 26. Cuttings 27. Approximate Geometric Query Structures 28. Geometric and Spatial Data Structures in External Memory Part 5: Miscellaneous 29. Tries 30. Suffix Trees and Suffix Arrays 31. String Search 32. Binary Decision Diagrams 33. Persistent Data Structures 34. Data Structures for Sets 35. Cache-Oblivious Data Structures 36. Dynamic Trees 37. Dynamic Graphs 38. Succinct Representation of Data Structures 39. Randomized Graph Data-Structures for Approximate Shortest Paths 40.Searching and Priority Queues in o(log n) Time Part 6: Data Structures in Langs & Libraries 41. Functional Data Structures 42. LEDA, a Platform for Combinatorial and Geometric Computing 43. Data Structures in C++44. Data Strauctures in JDSL 45. Data Structure Visualization 46. Drawing Trees 47. Drawing Graphs 48. Concurrent Data Structures Part 7: Applications 49. IP Router Tables 50. Multi-Dimensional Packet Classification 51. Data Structures in Web Information Retrieval 52. The Web as a Dynamic Graph 53. Layout Data Structures (Dinesh P. Mehta) 54. Floorplan Representation in VLSI 55. Computer Graphics 56. Geographic Information Systems 57. Collision Detection 58. Image Data Structures 59. Computational Biology 60. Data Structures for Cheminformatics 61. Elimination Structures in Scientific 62. Data Structures for Databases 63. Data Structures for Big Data Stores 64. Data Mining 65. Computational Geometry: Fundamental Structures 66. Computational Geometry: Proximity and Location 67. Computational Geometry: Generalized (or Colored) Intersection Searching


Best Sellers


Product Details
  • ISBN-13: 9780367572006
  • Publisher: Taylor & Francis Ltd
  • Publisher Imprint: Chapman & Hall/CRC
  • Height: 280 mm
  • No of Pages: 1100
  • Width: 210 mm
  • ISBN-10: 0367572001
  • Publisher Date: 30 Jun 2020
  • Binding: Paperback
  • Language: English
  • Weight: 2070 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Handbook of Data Structures and Applications
Taylor & Francis Ltd -
Handbook of Data Structures and Applications
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Handbook of Data Structures and Applications

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!