Cargando…

Handbook of data structures and applications /

Focusing on theoretical aspects of data structures as well as their applications, this book provides a comprehensive survey of data structures of various types, and offers background information for readers with no formal training in computer science. --

Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Mehta, Dinesh P. (Editor ), Sahni, Sartaj (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Boca Raton, FL : CRC Press, [2018]
Edición:Second edition.
Colección:Chapman & Hall/CRC computer and information science series.
Temas:
Acceso en línea:Texto completo (Requiere registro previo con correo institucional)
Tabla de Contenidos:
  • Part, I Fundamentals / Dinesh P. Mehta Sartaj Sahni
  • chapter 1 Analysis of Algorithms * / Sartaj Sahni
  • chapter 2 Basic Structures * / Dinesh P. Mehta
  • chapter 3 Trees * / Dinesh P. Mehta
  • chapter 4 Graphs * / Narsingh Deo
  • part, II Priority Queues / Dinesh P. Mehta Sartaj Sahni
  • chapter 5 Leftist Trees * / Sartaj Sahni
  • chapter 6 Skew Heaps * / C. Pandu Rangan
  • chapter 7 Binomial, Fibonacci, and Pairing Heaps / Michael L. Fredman
  • chapter 8 Double-Ended Priority Queues * / Sartaj Sahni
  • part, III Dictionary Structures / Dinesh P. Mehta Sartaj Sahni
  • chapter 9 Hash Tables * / Pat Morin
  • chapter 10 Bloom Filter and Its Variants / Shigang Chen
  • chapter 11 Balanced Binary Search Trees * / Arne Andersson Rolf Fagerberg Kim S. Larsen
  • chapter 12 Finger Search Trees * / Gerth Stølting Brodal
  • chapter 13 Splay Trees / Sanjeev Saxena
  • chapter 14 Randomized Dictionary Structures * / C. Pandu Rangan
  • chapter 15 Trees with Minimum Weighted Path Length / Wojciech Rytter
  • chapter 16 B Trees * / Donghui Zhang
  • part, IV Multidimensional/Spatial Structures / Dinesh P. Mehta Sartaj Sahni
  • chapter 17 Multidimensional Spatial Data Structures / Hanan Samet
  • chapter 18 Planar Straight Line Graphs * / Siu-Wing Cheng
  • chapter 19 Interval, Segment, Range, and Priority Search Trees / D.T. Lee Hung-I Yu
  • chapter 20 Quadtrees and Octrees * / Srinivas Aluru
  • chapter 21 Binary Space Partitioning Trees * / Bruce F. Naylor
  • chapter 22 R-Trees * / Scott Leutenegger Mario A. Lopez
  • chapter 23 Managing Spatiotemporal Data / Sumeet Dua S.S. Iyengar
  • chapter 24 Kinetic Data Structures * / Leonidas Guibas
  • chapter 25 Online Dictionary Structures / Teofilo F. Gonzalez
  • chapter 26 Cuttings * / Bernard Chazelle
  • chapter 27 Approximate Geometric Query Structures * / Christian A. Duncan Michael T. Goodrich
  • chapter 28 Geometric and Spatial Data Structures in External Memory / Jeffrey Scott Vitter
  • part, V Miscellaneous / Dinesh P. Mehta Sartaj Sahni
  • chapter 29 Tries * / Sartaj Sahni
  • chapter 30 Suffix Trees and Suffix Arrays * / Srinivas Aluru
  • chapter 31 String Searching / Andrzej Ehrenfeucht Ross M. McConnell
  • chapter 32 Binary Decision Diagrams / Shin-ichi Minato
  • chapter 33 Persistent Data Structures * / Haim Kaplan
  • chapter 34 Data Structures for Sets * / Rajeev Raman
  • chapter 35 Cache-Oblivious Data Structures * / Lars Arge Gerth Stølting Brodal Rolf Fagerberg
  • chapter 36 Dynamic Trees * / Camil Demetrescu Irene Finocchi Giuseppe F. Italiano
  • chapter 37 Dynamic Graphs * / Camil Demetrescu Irene Finocchi Giuseppe F. Italiano
  • chapter 38 Succinct Representation of Data Structures * / J. Ian Munro S. Srinivasa Rao
  • chapter 39 Randomized Graph Data-Structures for Approximate Shortest Paths * / Surender Baswana Sandeep Sen
  • chapter 40 Searching and Priority Queues in o(log n) Time * / Arne Andersson
  • part, VI Data Structures in Langs and Libraries / Dinesh P. Mehta Sartaj Sahni
  • chapter 41 Functional Data Structures * / Chris Okasaki
  • chapter 42 LEDA, a Platform for Combinatorial and Geometric Computing * / Stefan Naeher
  • chapter 43 Data Structures in C++ / Mark Allen Weiss
  • chapter 44 Data Structures in JDSL * / Michael T. Goodrich Roberto Tamassia Luca Vismara
  • chapter 45 Data Structure Visualization * / John Stasko
  • chapter 46 Drawing Trees * / Sebastian Leipert
  • chapter 47 Drawing Graphs * / Peter Eades Seok-Hee Hong
  • chapter 48 Concurrent Data Structures * / Mark Moir Nir Shavit
  • part, VII Applications / Dinesh P. Mehta Sartaj Sahni
  • chapter 49 IP Router Tables * / Sartaj Sahni Kun Suk Kim Haibin Lu
  • chapter 50 Multi-Dimensional Packet Classification * / Pankaj Gupta
  • chapter 51 Data Structures in Web Information Retrieval * / Monika Henzinger
  • chapter 52 The Web as a Dynamic Graph * / S.N. Maheshwari
  • chapter 53 Layout Data Structures * / Dinesh P. Mehta
  • chapter 54 Floorplan Representation in VLSI * / Zhou Feng Bo Yao Chung-Kuan Cheng
  • chapter 55 Computer Graphics * / Dale McMullin Alyn Rockwood
  • chapter 56 Geographic Information Systems / Bernhard Seeger Peter Widmayer
  • chapter 57 Collision Detection * / Ming C. Lin Dinesh Manocha
  • chapter 58 Image Data Structures * / S.S. Iyengar V.K. Vaishnavi S. Gunasekaran
  • chapter 59 Computational Biology / Paolo Ferragina Stefan Kurtz Stefano Lonardi Giovanni Manzini
  • chapter 60 Data Structures for Cheminformatics / Dinesh P. Mehta John D. Crabtree
  • chapter 61 Elimination Structures in Scientific Computing * / Alex Pothen Sivan Toledo
  • chapter 62 Data Structures for Databases * / Joachim Hammer Markus Schneider
  • chapter 63 Data Structures for Big Data Stores / Arun A. Ravindran Dinesh P. Mehta
  • chapter 64 Data Mining * / Vipin Kumar Pang-Ning Tan Michael Steinbach
  • chapter 65 Computational Geometry: Fundamental Structures * / Mark de Berg Bettina Speckmann
  • chapter 66 Computational Geometry: Proximity and Location * / Sunil Arya David M. Mount
  • chapter 67 Computational Geometry: Generalized (or Colored) Intersection Searching / Prosenjit Gupta Ravi Janardan Saladi Rahul Michiel Smid.