Pagina principaleGruppiConversazioniEsploraStatistiche
Cerca nel Sito
Questo sito utilizza i cookies per fornire i nostri servizi, per migliorare le prestazioni, per analisi, e (per gli utenti che accedono senza fare login) per la pubblicità. Usando LibraryThing confermi di aver letto e capito le nostre condizioni di servizio e la politica sulla privacy. Il tuo uso del sito e dei servizi è soggetto a tali politiche e condizioni.
Hide this

Risultati da Google Ricerca Libri

Fai clic su di un'immagine per andare a Google Ricerca Libri.

Sto caricando le informazioni...

Introduzione agli algoritmi e strutture dati

di Thomas H. Cormen, Charles E. Leiserson (Autore), Ronald L. Rivest (Autore), Clifford Stein

UtentiRecensioniPopolaritàMedia votiCitazioni
2,54064,660 (4.28)2
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.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, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. 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. The international paperback edition is no longer available; the hardcover is available worldwide.… (altro)
Aggiunto di recente dabiblioteca privata, brian.crouch, sfbulibrary, aesadde, eatonphil, alanese
  1. 10
    The Art of Computer Programming, Volumes 1-3 Boxed Set di Donald E. Knuth (billmcn)
    billmcn: The other definitive algorithms textbook, though I like Cormen better because it's shorter and more accessible.
Sto caricando le informazioni...

Iscriviti per consentire a LibraryThing di scoprire se ti piacerà questo libro.

Attualmente non vi sono conversazioni su questo libro.

» Vedi le 2 citazioni

apparently the second most cited computer science book, and for good reason. (no, i don't know the top most cited, and no, its not knuth). but, what a vast and exciting array of pseudocode, algorithms, and their data structures! good largley for being rich and dense, but readable. doesn't waste space over explaining, but should be sufficient for most anyone with a active interest.

an interesting feature, with respect to the exercises and especially problems for each chapter, is that i think cormen subscribes to a methodology where the solution to a problem should often require information or intuition not found in the chapter, nor even necessarily in the preceding chapters. you find yourself driving towards solutions that are used in later sections, or revisiting old problems once you find a better solution later on.

and, of course, cormen is here at dartmouth. one should probably always have a copy handy when writing code. ( )
1 vota jmilloy | Nov 8, 2017 |
This book is like an encyclopedia of algorithms. The algorithms are presented with pseudo code so it doesn’t matter what your favorite programming language is. A very rigorous mathematical approach is used for the analysis of for instance performance. ( )
  IvanIdris | Dec 26, 2011 |
Normally I wouldn't review a textbook, but reading this one is enjoyable.

It's one of the very best textbooks I've ever used. Unbelievably well written. Well organized. Great examples and pictures. Clearly explained proofs. It is easy to read and learn from. I'm surprised I was able to get an already-used copy of this book; I'll be keeping mine for a very long time. ( )
  pammab | Dec 15, 2011 |
The definitive graduate or upper-level undergraduate computer science textbook. This is the place to go to learn basic algorithms, data structures, proofs of correctness, and big-O notation. I prefer it to Knuth's three-volume opus, because it's shorter and doesn't get bogged down in the details of an artificial assembly language.

Cormen et al. also makes for a fine self-study guide. If you're reading it on your own, check out the MIT Open Course Introduction to Algorithms class, which has a full set of online lectures and problem sets based on this book. ( )
2 vota billmcn | May 28, 2010 |
Questa recensione è stata segnalata da più utenti come violazione delle condizioni d'uso e non è più visibile (mostra).
  knol | Dec 25, 2009 |
nessuna recensione | aggiungi una recensione

» Aggiungi altri autori (57 potenziali)

Nome dell'autoreRuoloTipo di autoreOpera?Stato
Thomas H. Cormenautore primariotutte le edizionicalcolato
Leiserson, Charles E.Autoreautore principaletutte le edizioniconfermato
Rivest, Ronald L.Autoreautore principaletutte le edizioniconfermato
Stein, Cliffordautore principaletutte le edizioniconfermato
Devi effettuare l'accesso per contribuire alle Informazioni generali.
Per maggiori spiegazioni, vedi la pagina di aiuto delle informazioni generali.
Titolo canonico
Dati dalle informazioni generali inglesi. Modifica per tradurlo nella tua lingua.
Titolo originale
Titoli alternativi
Dati dalle informazioni generali inglesi. Modifica per tradurlo nella tua lingua.
Data della prima edizione
Personaggi
Luoghi significativi
Eventi significativi
Film correlati
Premi e riconoscimenti
Epigrafe
Dedica
Incipit
Dati dalle informazioni generali inglesi. Modifica per tradurlo nella tua lingua.
What are algorithms?
Citazioni
Ultime parole
Nota di disambiguazione
Redattore editoriale
Elogi
Lingua originale
DDC/MDS Canonico
LCC canonico
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.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, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. 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. The international paperback edition is no longer available; the hardcover is available worldwide.

Non sono state trovate descrizioni di biblioteche

Descrizione del libro
Riassunto haiku

Copertine popolari

Link rapidi

Voto

Media: (4.28)
0.5
1 1
1.5
2 6
2.5
3 32
3.5 1
4 110
4.5 9
5 123

Sei tu?

Diventa un autore di LibraryThing.

 

A proposito di | Contatto | LibraryThing.com | Privacy/Condizioni d'uso | Guida/FAQ | Blog | Negozio | APIs | TinyCat | Biblioteche di personaggi celebri | Recensori in anteprima | Informazioni generali | 170,258,195 libri! | Barra superiore: Sempre visibile