Some books on algorithms are rigorous but incomplete; others cover
masses of material but lack rigor. Introduction to Algorithms uniquely
combines rigor and comprehensiveness. The book covers a broad range
of algorithms in depth, yet makes their design and analysis accessible
to all levels of readers. Each chapter is relatively self-contained
and can be used as a unit of study. The algorithms are described
in English and in a pseudocode designed to be readable by anyone
who has done a little programming. The explanations have been kept
elementary without sacrificing depth of coverage or mathematical
rigor. This new edition of the essential text and professional reference,
adds substantial new material on such topics as vEB trees, multithreaded
algorithms, dynamic programming, and edge-based flow.
%0 Book
%1 CormenLeisersonEtAl09
%A Cormen, Thomas H.
%A Leiserson, Charles E.
%A Rivest, Ronald L.
%A Stein, Clifford
%C Cambridge, MA
%D 2009
%I MIT Press
%K 01841 105 algorithm book mitpress shelf theory
%T Introduction to Algorithms
%X Some books on algorithms are rigorous but incomplete; others cover
masses of material but lack rigor. Introduction to Algorithms uniquely
combines rigor and comprehensiveness. The book covers a broad range
of algorithms in depth, yet makes their design and analysis accessible
to all levels of readers. Each chapter is relatively self-contained
and can be used as a unit of study. The algorithms are described
in English and in a pseudocode designed to be readable by anyone
who has done a little programming. The explanations have been kept
elementary without sacrificing depth of coverage or mathematical
rigor. This new edition of the essential text and professional reference,
adds substantial new material on such topics as vEB trees, multithreaded
algorithms, dynamic programming, and edge-based flow.
%7 3
%@ 978-0-262-03384-8
@book{CormenLeisersonEtAl09,
abstract = {Some books on algorithms are rigorous but incomplete; others cover
masses of material but lack rigor. Introduction to Algorithms uniquely
combines rigor and comprehensiveness. The book covers a broad range
of algorithms in depth, yet makes their design and analysis accessible
to all levels of readers. Each chapter is relatively self-contained
and can be used as a unit of study. The algorithms are described
in English and in a pseudocode designed to be readable by anyone
who has done a little programming. The explanations have been kept
elementary without sacrificing depth of coverage or mathematical
rigor. This new edition of the essential text and professional reference,
adds substantial new material on such topics as vEB trees, multithreaded
algorithms, dynamic programming, and edge-based flow.},
added-at = {2018-08-26T15:42:10.000+0200},
address = {Cambridge, MA},
author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford},
biburl = {https://www.bibsonomy.org/bibtex/28b6e267f62d8e23bbb127307ff7a4a0f/flint63},
comment = {1st edition 1990 Paperback},
edition = 3,
file = {eBook:2009/CormenLeisersonEtAl09.pdf:PDF;MIT Press Product Page:https\://mitpress.mit.edu/books/introduction-algorithms-third-edition:URL;Amazon Search inside:http\://www.amazon.de/gp/reader/0262033844/:URL},
interhash = {a5e3e9cb3fe0f62575df69d504e53809},
intrahash = {8b6e267f62d8e23bbb127307ff7a4a0f},
isbn = {978-0-262-03384-8},
keywords = {01841 105 algorithm book mitpress shelf theory},
owner = {flint},
publisher = {MIT Press},
timestamp = {2018-08-26T15:42:10.000+0200},
title = {Introduction to Algorithms},
year = 2009
}