Handbook of data structures and applications

Handbook of data structures and applications

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

Descripción completa

Detalles Bibliográficos
Otros Autores: Mehta, Dinesh, author (author), Mehta, Dinesh P., editor (editor), Sahni, Sartaj, editor
Formato: Libro electrónico
Idioma:Inglés
Publicado: Boca Raton, Florida ; London, [England] ; New York : CRC Press 2018.
Edición:Second edition
Colección:Chapman & Hall/CRC computer and information science series.
Materias:
System design > Handbooks, manuals, etc.
Data structures (Computer science) > Handbooks, manuals, etc.
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009631106406719
Tabla de Contenidos:
  • Cover
  • Half Title
  • Title Page
  • Copyright Page
  • Dedication
  • Contents
  • Preface to the Second Edition
  • Preface to the First Edition
  • Editors
  • Contributors
  • 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 Minimum 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, and Priority Search Trees
  • 20. Quadtrees and Octrees
  • 21. Binary Space Partitioning Trees
  • 22. R-Trees
  • 23. Managing Spatiotemporal Data
  • 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 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 for Approximate Shortest Paths
  • 40. Searching and Priority Queues in o(log n) Time
  • Part VI: Data Structures in Langs and Libraries
  • 41. Functional Data Structures
  • 42. LEDA, a Platform for Combinatorial and Geometric Computing
  • 43. Data Structures in C++
  • 44. Data Structures in JDSL.
  • 45. Data Structure Visualization
  • 46. Drawing Trees
  • 47. Drawing Graphs
  • 48. Concurrent Data Structures
  • Part VII: 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
  • 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 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.

Ejemplares similares