Introduction to algorithms
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 reader...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| 格式: | Livre papier |
| 語言: | Anglais |
| 出版: |
Cambridge (Mass.) :
MIT Press
C 2009.
|
| 版: | 3rd edition. |
| 主題: | |
| 提示: |
Autre contribution : Clifford Stein (auteur) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,... [et al.], 3rd edition, 2009, Cambridge, Massachusetts, MIT Press, 978-02-622-708-30 |
| LEADER | 03134nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 357077 | ||
| 008 | 090903t20092009xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN136281273 | ||
| 020 | |a 9780262033848 (rel.) | ||
| 020 | |a 9780262533058 (br.) | ||
| 024 | |a 9780262033848 | ||
| 024 | |a 9780262533058 | ||
| 041 | 0 | |a eng |f eng | |
| 082 | |a 005.1 | ||
| 084 | |a F.2 | ||
| 084 | |a 68Q20. 2010 | ||
| 084 | |a 68Rxx. 2010 | ||
| 100 | 1 | |a Cormen, Thomas H., |d 19..- | |
| 245 | 1 | 0 | |a Introduction to algorithms |c Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,... [et autres]. |
| 250 | |a 3rd edition. | ||
| 260 | |a Cambridge (Mass.) : |b MIT Press. | ||
| 260 | |c C 2009. | ||
| 300 | |a 1 volume (xix-1292 pages) : |b illustrations, couverture illustrée en couleurs ; |c 24 cm. | ||
| 500 | |a Autre contribution : Clifford Stein (auteur) | ||
| 504 | |a Bibliographie p. [1231]-1250. Index | ||
| 520 | |a 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. - The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition (Cit. 4e de couv.] | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Algorithmes | ||
| 650 | |a Structures de données (informatique) | ||
| 700 | 1 | |a Leiserson, Charles Eric. |4 aut | |
| 700 | 1 | |a Rivest, Ronald L., |d 1947- |4 aut | |
| 700 | 1 | |a Stein, Clifford, |d 1965- |4 aut | |
| 767 | 0 | |0 145360164 |t Algorithmique |o cours avec 957 exercices et 158 problèmes |f Thomas H. Cormen,... Charles E. Leiserson,... Ronald L. Rivest,... [et autres] |e 3e édition [avec compléments en ligne] |d 2010 |c Paris |n Dunod |p 1 volume (xxix-1188 pages) |s Sciences sup |z 978-2-10-054526-1 | |
| 776 | 0 | |0 166870854 |t Introduction to Algorithms |f Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,... [et al.] |e 3rd edition |d 2009 |c Cambridge, Massachusetts |n MIT Press |z 978-02-622-708-30 | |
| 997 | |0 357077 |1 Livre papier |a Ressource papier |c 0/Orléans/ |c 1/Orléans/BU Sciences, Technologies, STAPS/ |z Orléans, BU Sciences, Technologies, STAPS, 005.1 INT | ||