Find a copy online
Links to this item
Find a copy in the library
Finding libraries that hold this item...
Details
| Material Type: | Internet resource |
|---|---|
| Document Type: | Book, Internet Resource |
| All Authors / Contributors: |
Thomas H Cormen; et al |
| ISBN: | 9780262033848 0262033844 9780262533058 0262533057 |
| OCLC Number: | 311310321 |
| Description: | xix, 1292 p. : ill. ; 24 cm. |
| Contents: | I. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices. |
| Responsibility: | Thomas H. Cormen ... [et al.]. |
| More information: |
Abstract:
Reviews
Publisher Synopsis
"In light of the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. This beautifully written, thoughtfully organized book is the definitive introductory book on the design and analysis of algorithms. The first half offers an effective method to teach and study algorithms; the second half then engages more advanced readers and curious students with compelling material on both the possibilities and the challenges in this fascinating field." --Shang-Hua Teng, University of Southern California "Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance." --Daniel Spielman, Department of Computer Science, Yale University "As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference." --Gabriel Robins, Department of Computer Science, University of Virginia Read more...
Tags
Similar Items
Related Subjects:(7)
- Bilgasayar programlama.
- Bilgisayar algoritmaları.
- Computer programming.
- Computer algorithms.
- Algoritmen.
- Algorithmische Programmierung.
- Algorithmentheorie.
User lists with this item (3)
- New science books - February 2012(21 items)
by nsprague updated about 4 days ago
- AccumulativeLiterature(159 items)
by ookwudili updated 2011-08-10
- Q1-390 - QR1-502 Newly Acquired Science Titles (133 items)
by bevdchar updated 2010-11-28
