Handbook of Data Structures and Applications
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Handbook of Data Structures and Applications: (Chapman & Hall/CRC Computer and Information Science Series)
Handbook of Data Structures and Applications: (Chapman & Hall/CRC Computer and Information Science Series)

Handbook of Data Structures and Applications: (Chapman & Hall/CRC Computer and Information Science Series)


     0     
5
4
3
2
1



Available


X
About the Book

Although there are many advanced and specialized texts and handbooks on algorithms, until now there was no book that focused exclusively on the wide variety of data structures that have been reported in the literature. The Handbook of Data Structures and Applications responds to the needs of students, professionals, and researchers who need a mainstream reference on data structures by providing a comprehensive survey of data structures of various types. Divided into seven parts, the text 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. The Handbook is invaluable in 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:
Fundamentals Analysis of Algorithms Sartaj Sahni University of Florida, Gainesville, USA Basic Structures Dinesh P. Mehta Colorado School of Mines, Golden, Colorado, USA Trees Dinesh P. Mehta Graphs Narsingh Deo University of Central Florida, Orlando, USA Priority Queues Leftist Trees Sartaj Sahni Skew Heaps C. Pandu Rangan Indian Institute of Technology, Madras, Chennai Binomial, Fibonacci, and Pairing Heaps Michael L. Fredman Rutgers University, New Brunswick, New Jersey, USA Double-Ended Priority Queues Sartaj Sahni Dictionary Structures Hash Tables Pat Morin Carleton University, Ottawa, Ontario, Canada Balanced Binary Search Trees Arne Andersson, Uppsala University, Sweden Rolf Fagerberg and Kim S. Larsen, University of Southern Denmark, Odense Finger Search Trees Gerth Stølting Brodal University of Aarhus, Denmark Splay Trees Sanjeev Saxena Indian Institute of Technology, Kanpur Randomized Dictionary Structures C. Pandu Rangan Trees with Minimum Weighted Path Length Wojciech Rytter New Jersey Instituteof Technology, Newark, USA B. Trees Donghui Zhang Northeastern University, Boston, Massachusetts, USA Multidimensional and Spatial Structures Multidimensional Spatial Data Structures Hanan Samet University of Maryland, College Park, USA Planar Straight Line Graphs Siu-Wing Cheng The Hong Kong University of Science and Technology, Kowloon Interval, Segment, Range, and Priority Search Trees D. T. Lee Academia Sinica, Taipei, Taiwan Quadtrees and Octrees Srinivas Aluru Iowa State University, Ames, USA Binary Space Partitioning Trees Bruce F. Naylor University of Texas, Austin, USA R-Trees Scott Leutenegger and Mario A. Lopez University of Denver, Colorado, USA Managing Spatio-Temporal Data Sumeet Dua Louisiana Tech University, Ruston, USA S. S. Iyengar Louisiana State University, Baton Rouge, USA Kinetic Data Structures Leonidas Guibas Stanford University Palo Alto, California, USA Online Dictionary Structures Teofilo F. Gonzalez University of California, Santa Barbara, USA Cuttings Bernard Chazelle Princeton University, Princeton, New Jersey, USA Approximate Geometric Query Structures Christian A. Duncan University of Miami, Florida, USA Michael T. Goodrich University of California, Irvine, USA Geometric and Spatial Data Structures in External Memory Jeffrey Scott Vitter Purdue University West Lafayette, Indiana, USA Miscellaneous Data Structures Tries Sartaj Sahni Suffix Trees and Suffix Arrays Srinivas Aluru String Searching Andrzej Ehrenfeuch University of Colorado, Boulder, USA Ross M. McConnell Colorado State University, Fort Collins, USA Persistent Data Structures Haim Kaplan Tel Aviv University, Israel PC Trees Wen-Lian Hsu Academia Sinica, Taipei, Taiwan Ross M. McConnell Data Structures for Sets Rajeev Raman University of Leicester, UK Cache-Oblivious Data Structures Lars Arge Duke University, Durham, North Carolina, USA, Gerth Stølting Brodal University of Aarhus, Denmark Rolf Fagerberg Dynamic Trees Camil Demetrescu, Irene Finocchi, and Giuseppe F. Italiano Universitá di Roma, Italy Dynamic Graphs Camil Demetrescu, Irene Finocchi, and Giuseppe F. Italiano Succinct Representation of Data Structures J. Ian Munro and S. Srinivasa Rao University of Waterloo, Ontario, Canada Randomized Graph Data-Structures for Approximate Shortest Paths Surender Baswana and Sandeep Sen Indian Institute of Technology, Delhi, India Searching and Priority Queues in o(log n) Time Arne Andersson Data Structures in Languages and Libraries Functional Data Structures Chris Okasaki United States Military Academy, West Point, New York LEDA, a Platform for Combinatorial and Geometric Computing Stefan Naeher University of Trier, Germany Data Structures in C++ Mark Allen Weiss Florida International University, Miami, USA Data Structures in JDSL Michael T. Goodrich Roberto Tamassia, and Luca Vismara Brown University, Providence, Rhode Island, USA Data Structure Visualization John Stasko Georgia Institute of Technology, Atlanta, USA Drawing Trees Sebastian Leipert Center of Advanced European Studies and Research, Bonn, Germany Drawing Graphs Peter Eades and Seok-Hee Hong University of Sydney and NICTA, Australia Concurrent Data Structures Mark Moir and Nir Shavit Sun Microsystems Laboratories, Burlington, Massachusetts, USA Applications IP Router Tables Sartaj Sahni Kun Suk Kim and Haibin Lu University of Florida, Gainesville, USA Multi-Dimensional Packet Classification Pankaj Gupta Cypress Semiconductor, San Jose, California, USA Data Structures in Web Information Retrieval Monika Henzinger Google, Inc., Mountain View, California, USA The Web as a Dynamic Graph S.N.Maheshwari Indian Institute of Technology, Madras, Chennai Layout Data Structures Dinesh P. Mehta Floorplan Representation in VLSI Zhou Fen Fudan University, Shanghai, China Bo Yao, and Chung-Kuan Cheng University of California, San Diego Computer Graphics Dale McMullin and Alyn Rockwood Colorado School of Mines, Golden, USA Geographic Information Systems Bernhard Seeger University of Marburg, Germany Peter Widmayer ETH, Zurich, Switzerland Collision Detection Ming C. Lin and Dinesh Manocha University of North Carolina, Chapel Hill, USA Image Data Structures S. Sitharama Iyengar V. K. Vaishnavi Georgia State University, Atlanta, USA S. Gunasekaran Louisiana State University, Baton Rouge, USA Computational Biology Stefan Kurtz University of Hamburg, Germany Stefano Lonardi University of California, Riverside, USA Elimination Structures in Scientific Computing Alex Pothen Old Dominion University, Norfolk, Virginia, USA Sivan Toledo Tel Aviv University, Israel Data Structures for Databases Joachim Hammer and Markus Schneider University of Florida, Gainesville, USA Data Mining Vipin Kumar and Michael Steinbach University of Minnesota, Minneapolis, USA Pang-Ning Tan Michigan State University, East Lansing, USA Computational Geometry: Fundamental Structures Mark de Berg and Bettina Speckmann Technical University, Eindhoven, The Netherlands Computational Geometry: Proximity and Location Sunil Arya The Hong Kong University of Scienceand Technology, Kowloon David M. Mount University of Maryland, College Park, USA Computational Geometry: Generalized Intersection Searching Prosenjit Gupta International Institute of Information Technology, Hyderabad, India Ravi Janardan University of Minnesota, Minneapolis, USA Michiel Smid Carleton University, Ottawa, Ontario, Canada


Best Sellers


Product Details
  • ISBN-13: 9781584884354
  • Publisher: Taylor & Francis Inc
  • Publisher Imprint: Chapman & Hall/CRC
  • Height: 254 mm
  • No of Pages: 1392
  • Returnable: N
  • Weight: 2518 gr
  • ISBN-10: 1584884355
  • Publisher Date: 28 Oct 2004
  • Binding: Hardback
  • Language: English
  • No of Pages: 1392
  • Series Title: Chapman & Hall/CRC Computer and Information Science Series
  • Width: 178 mm


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: (Chapman & Hall/CRC Computer and Information Science Series)
Taylor & Francis Inc -
Handbook of Data Structures and Applications: (Chapman & Hall/CRC Computer and Information Science Series)
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: (Chapman & Hall/CRC Computer and Information Science Series)

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!