Format:
xix, 1292 Seiten
,
Illustrationen
Edition:
Third edition
ISBN:
9780262033848
,
9780262533058
,
0262533057
Content:
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
Note:
Includes bibliographical references and index
,
Hier auch später erschienene, unveränderte Nachdrucke der 3. Auflage
Additional Edition:
Erscheint auch als Online-Ausgabe Cormen, Thomas H. Introduction to Algorithms Cambridge, Massachusetts : The MIT Press, 2009 ISBN 9780262270830
Additional Edition:
Erscheint auch als Online-Ausgabe Introduction to algorithms Cambridge, Mass. [u.a.] : MIT Press, 2009 ISBN 9780262270830
Additional Edition:
Erscheint auch als Online-Ausgabe Cormen, Thomas H. Introduction to algorithms Cambridge, Massachusetts : MIT Press, 2009 ISBN 9780262270830
Language:
English
Subjects:
Computer Science
,
Mathematics
Keywords:
Algorithmentheorie
;
Algorithmus
;
Datenstruktur
;
Lehrbuch
Author information:
Cormen, Thomas H.
Bookmarklink
