Mehta / Sahni Handbook of Data Structures and Applications, Second Edition

2. Auflage 2018
ISBN: 978-1-4987-0188-4
Verlag: CRC Press
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, 1120 Seiten

Reihe: Chapman & Hall/CRC Computer and Information Science Series

This book is a mainstream reference on data structures by providing a comprehensive survey of data structures of various types. This second edition has been revised and updated with new chapters on binary decision diagrams, kd trees and data structures in cheminformatics, geophysics applications and large-scale graph processing in the cloud.

Autoren/Hrsg.

Mehta, Dinesh P.

Sahni, Sartaj

Fachgebiete

• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
• Mathematik | Informatik Mathematik Algebra Zahlentheorie
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie

Inhaltsverzeichnis

Part 1: Introduction

1. Analysis of Algorithms (Sartaj Sahni)

2. Basic Structures (Dinesh P. Mehta)

3. Trees (Dinesh P. Mehta)

4. Graphs (Narsingh Deo)

Part 2: Priority Queues

5. Leftist Trees (Sartaj Sahni)

6. Skew Heaps (C. Pandu Rangan)

7. Binomial, Fibonacci,and Pairing Heaps (Michael L. Fredman)

8. Double-Ended Priority Queues (Sartaj Sahni)

Part 3: Dictionary Structures

9. Hash Tables (Pat Morin)

10. Bloom Filter and Its Variants (Chen and et al.)

11. Balanced Binary Search Trees (Arne Andersson, Rolf Fagerberg, Kim S. Larsen)

12. Finger Search Trees (Gerth Stølting Brodal)

13. Splay Trees (Sanjeev Saxena)

14. Randomized Dictionary Structures (C. Pandu Rangan)

15. Trees with Minimum Weighted Path Length (Wojciech Rytter)

16. B Trees (Donghui Zhang)

Part 4: Multidimensional/Spatial Structures

17. Multidimensional Spatial Data Structs (Hanan Samet)

18. Planar Straight Line Graphs (Siu-Wing Cheng)

19. Interval, Segment, Range, and Priority Search Trees (D.T. Lee, Hung-I Yu)

20 Quadtrees and Octrees (Srinivas Aluru)

21. Binary Space Partitioning Trees (Bruce F. Naylor)

22. R-trees (Scott Leutenegger, Mario A. Lopez)

23. Multidimensional and Spatial Structures (Sumeet Dua and S.S. Iyengar)

24. Kinetic Data Structures (Leonidas Guibas)

25. Online Dictionary Structures (Teofilo F. Gonzalez)

26. Cuttings (Bernard Chazelle)

27. Approximate Geometric Query Structures (Christian A. Duncan, Michael T. Goodrich)

28. Geometric and Spatial Data Structures in External Memory (Jeffrey Scott Vitter)

Part 5: Miscellaneous

29. Tries (Sartaj Sahni)

30. Suffix Trees and Suffix Arrays (Srinivas Aluru)

31. String Search (Andrezej Ehrenfeucht, Ross M. McConnell)

32. Binary Decision Diagrams (Shin-ichi Minato)

33. Persistent Data Structures (Haim Kaplan)

34. Data Structures for Sets (Rajeev Raman)

35. Cache-Oblivious Data Structures (Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg)

36. Dynamic Trees (Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano)

37. Dynamic Graphs (Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano)

38. Succinct Representation of Data Structures (J. Ian Munro, S. Srinivasa Rao)

39. Randomized Graph Data-Structures for Approximate Shortest Paths (Surender Baswana, Sandeep Sen)

40.Searching and Priority Queues in o(log n) Time (Arne Andersson)

Part 6: Data Structures in Langs & Libraries

41. Functional Data Structures (Chris Okasaki)

42. LEDA, a Platform for Combinatorial and Geometric Computing (Stefan Naeher)

43. Data Structures in C++ (Mark Allen Weiss)

44. Data Structures in JDSL (Michael T. Goodrich, Roberto Tamassia, Luca Vismara)

45. Data Structure Visualization (John Stasko)

46. Drawing Trees (Sebastian Leipert)

47. Drawing Graphs (Peter Eades, Seok-Hee Hong)

48. Concurrent Data Structures (Mark Moir, Nir Shavit)

Part 7: Applications

49. IP Router Tables (Sartaj Sahni, Kun Suk Kim, Haibin Lu)

50. Multi-Dimensional Packet Classification (Pankaj Gupta)

51. Data Structures in Web Information Retrieval (Monika Henzinger)

52. The Web as a Dynamic Graph (S. N. Maheshwari)

53. Layout Data Structures (Dinesh P. Mehta)

54. Floorplan Representation in VLSI (Zhou Feng, Bo Yao, Chung-Kuan Cheng)

55. Computer Graphics (Dale McMullin, Alyn Rockwood)

56. Geographic Information Systems (Seeger, Widmayer)

57. Collision Detection (Ming C. Lin, Dinesh Manocha)

58. Image Data Structures (S.S. Iyengar, V.K. Vaishnavi, S. Gunasekaran)

59. Computational Biology (Paolo Ferragina, Stefan Kurtz, Stefano Lonarid, Giovanni Manzini)

60. Data Structures for Cheminformatics (Dinesh P. Mehta, John D. Crabtree)

61. Elimination Structures in Scientific Computing (Alex Pothen, Sivan Toledo)

62. Data Structures for Databases (Joachim Hammer, Markus Schneider)

63. Data Structures for Big Data Stores (Arun A. Ravindran and Dinesh P. Mehta)

64. Data Mining (Vipin Kumar, Pang-Ning Tan, Michael Steinbach)

65. Computational Geometry: Fundamental Structures (Mark de Berg, Bettina Speckamnn)

66. Computational Geometry: Proximity and Location (Sunil Arya, David M. Mount)

67. Computational Geometry: Generalized (or Colored) Intersection Searching (Prosenjit Gupta, Ravi Janardan, Saladi Rahul, Michiel Smid)

Über Autor(innen)

Dinesh P. Mehta received his Ph.D. degree in computer science from the University of Florida in 1992. He was on the faculty at the University of Tennessee Space Institute from 1992-2000, where he received the Vice President’s Award for Teaching Excellence in 1997.

Dr. Mehta is a co-author of the text Fundamentals of Data Structures in C ++. His publications and research interests are in VLSI design automation, parallel computing, and applied algorithms and data structures. His data structures-related research has involved the development or application of diverse data structures such as directed acyclic word graphs (DAWGs) for strings, corner stitching for VLSI layout, the Q-sequence floorplan representation, binary decision trees, Voronoi diagrams and TPR trees for indexing moving points. Dr. Mehta is currently an Associate Editor of the IEEE Transactions on Circuits and Systems-I.

Sartaj Sahni is a Distinguished Professor and Chair of Computer and Information Sciences and Engineering at the University of Florida. He is also a member of the European Academy of Sciences, a Fellow of IEEE, ACM, AAAS, and Minnesota Supercomputer Institute, and a Distinguished Alumnus of the Indian Institute of Technology, Kanpur.

Dr. Sahni is the recipient of the 1997 IEEE Computer Society Taylor L. Booth Education Award, the 2003 IEEE Computer Society W. Wallace McDowell Award and the 2003 ACM Karl Karlstrom Outstanding Educator Award. Dr. Sahni received his B.Tech. (Electrical Engineering) degree from the Indian Institute of Technology, Kanpur, and the M.S. and Ph.D. degrees in Computer Science from Cornell University. Dr. Sahni has published over two hundred and fifty research papers and written 15 texts. His research publications are on the design and analysis of efficient algorithms, parallel computing, interconnection networks, design automation, and medical algorithms.