Vai al contenuto principale della pagina

Introduction to algorithms [[electronic resource] /] / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Introduction to algorithms [[electronic resource] /] / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein Visualizza cluster
Pubblicazione: Cambridge, Mass., : MIT Press, 2009
Edizione: 3rd ed.
Descrizione fisica: 1 online resource (xix, 1293 pages) : illustrations
Disciplina: 005.1
Soggetto topico: Computer programming
Computer algorithms
Soggetto genere / forma: Electronic books.
Altri autori: CormenThomas H  
LeisersonCharles E  
RivestRonald L  
SteinClifford  
Note generali: Description based upon print version of record.
Nota di bibliografia: Includes bibliographical references (p. [1231]-1250) and index.
Nota di contenuto: ""Contents""; ""Preface""; ""I Foundations""; ""1 The Role of Algorithms in Computing""; ""2 Getting Started""; ""3 Growth of Functions""; ""4 Divide-and-Conquer""; ""5 Probabilistic Analysis and Randomized Algorithms""; ""II Sorting and Order Statistics""; ""6 Heapsort""; ""7 Quicksort""; ""8 Sorting in Linear Time""; ""9 Medians and Order Statistics""; ""III Data Structures""; ""10 Elementary Data Structures""; ""11 Hash Tables""; ""12 Binary Search Trees""; ""13 Red-Black Trees""; ""14 Augmenting Data Structures""; ""IV Advanced Design and Analysis Techniques""; ""15 Dynamic Programming""
""16 Greedy Algorithms""""17 Amortized Analysis""; ""V Advanced Data Structures""; ""18 B-Trees""; ""19 Fibonacci Heaps""; ""20 van Emde Boas Trees""; ""21 Data Structures for Disjoint Sets""; ""VI Graph Algorithms""; ""22 Elementary Graph Algorithms""; ""23 Minimum Spanning Trees""; ""24 Single-Source Shortest Paths""; ""25 All-Pairs Shortest Paths""; ""26 Maximum Flow""; ""VII Selected Topics""; ""27 Multithreaded Algorithms""; ""28 Matrix Operations""; ""29 Linear Programming""; ""30 Polynomials and the FFT""; ""31 Number-Theoretic Algorithms""; ""32 String Matching""
""33 Computational Geometry""""34 NP-Completeness""; ""35 Approximation Algorithms""; ""VIII Appendix: Mathematical Background""; ""A Summations""; ""B Sets, Etc.""; ""C Counting and Probability""; ""D Matrices""; ""Bibliography""; ""Index""
Titolo autorizzato: Introduction to algorithms  Visualizza cluster
ISBN: 9780262270830
9780262533058
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910465073003321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui