Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Handbook of Data Structures and Applications

Handbook of Data Structures and Applications (1st Edition)

Information

  • Editors: Dinesh P. Mehta, Sartaj Sahni
  • Publisher: Chapman and Hall/CRC, Taylor & Francis, 2004
  • ISBN-10: 1-58488-435-5 (1584884355)
  • ISBN-13: 978-1-58488-435-4 (9781584884354)

Links

Handbook of Data Structures and Applications (2nd Edition)

Information

  • Editors: Dinesh P. Mehta, Sartaj Sahni
  • Publisher: Chapman and Hall/CRC, Taylor & Francis, 2018
  • ISBN-10: 0-367-57200-1 (0367572001)
  • ISBN-13: 978-0-367-57200-6 (9780367572006)

Links


  • PART I: Fundamentals
    • 1. Analysis of Algorithms
    • 2. Basic Structures
    • 3. Trees
    • 4. Graphs
  • PART II: Priority Queues
    • 5. Leftist Trees
    • 6. Skew Heaps
    • 7. Binomial, Fibonacci, and Pairing Heaps
    • 8. Double-Ended Priority Queues
  • PART III: 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 Min Weighted Path Length
    • 16. B Trees
  • PART IV: Multidimensional/Spatial Structures
    • 17. Multidimensional Spatial Data Structures
    • 18. Planar Straight Line Graphs
    • 19. Interval, Segment, Range, Priority Search Trees
    • 20. Quadtrees and Octtrees
    • 21. BSP Trees
    • 22. R-Trees
    • 23. Managing Spatio-Temporal Data
    • 24. Kinetic Data Structures
    • 25. Online Dictionary Structures
    • 26. Cuttings
    • 27. Approximate Geom Query Structures
    • 28. Geometric and Spatial Data Structures in External Memory
  • PART V: Miscellaneous
    • 29. Tries
    • 30. Suffix Trees and Suffix Arrays
    • 31. String Searching
    • 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
    • 40. Searching and Priority Queues in o(log n) Time
  • PART VI: Data Structures in Langs and Libraries
    • 41. Fundamental Data Structures
    • 42. LEDA, a Platform for Combinatorial and Geometric Computing
    • 43. Data Structures in C++
    • 44. Data Structures in JDSI
    • 45. Data Structure Visualization
    • 46. Drawing Trees
    • 47. Drawing Graphs
    • 48. Concurrent Data Structures
  • PART VII: Applications
    • 49. IP Router Tables
    • 50. Multidimensional Packet Classification
    • 51. Data Structures in Web Information Retrieval
    • 52. The Web as a Dynamic Graph
    • 53. Layout Data Structures
    • 54. Floorplan Rep 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 Computing
    • 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
  • Index
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment