Počet záznamů: 1
Introduction to Algorithms
Údaje o názvu Introduction to Algorithms. Údaje o vydání 3rd ed. Nakladatel Cambridge : MIT Press, 2009. Copyright ?009. Fyz.popis 1 online resource (1314 pages) ISBN 9780262270830 (online bk.) Edice The MIT Press Ser. Úplný obsah Intro -- Contents -- Preface -- I Foundations -- Introduction -- 1 The Role of Algorithms in Computing -- 2 Getting Started -- 3 Growth of FunctionsThe -- 4 Divide-and-Conquer -- 5 Probabilistic Analysis and RandomizedAlgorithms -- II Sorting and Order Statistics -- Introduction -- 6 Heapsort -- 7 QuicksortThe -- 8 Sorting in Linear Time -- 9 Medians and Order Statistics -- III Data Structures -- Introduction -- 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 -- Introduction -- 15 Dynamic Programming -- 16 Greedy Algorithms -- 17 Amortized Analysis -- V Advanced Data Structures -- Introduction -- 18 B-Trees -- 19 Fibonacci Heaps -- 20 van Emde Boas Trees -- 21 Data Structures for Disjoint Sets -- VI Graph Algorithms -- Introduction -- 22 Elementary Graph Algorithms -- 23 Minimum Spanning Trees -- 24 Single-Source Shortest Paths -- 25 All-Pairs Shortest Paths -- 26 Maximum Flow -- VII Selected Topics -- Introduction -- 27 Multithreaded AlgorithmsThe -- 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 -- Introduction -- A Summations -- B Sets, Etc. -- C Counting and Probability -- D Matrices -- Bibliography -- Index. Poznámky k dostupnosti Přístup pouze pro oprávněné uživatele Dal.odpovědnost Leiserson, Charles E. Rivest, Ronald L. Stein, Clifford. Předmět.hesla Computer algorithms. * Computer programming. Forma, žánr elektronické knihy electronic books Země vyd. Bez místa Jazyk dok. angličtina Druh dok. Elektronické knihy URL Plný text pro studenty a zaměstnance UPOL 
kniha
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.
Intro -- Contents -- Preface -- I Foundations -- Introduction -- 1 The Role of Algorithms in Computing -- 2 Getting Started -- 3 Growth of FunctionsThe -- 4 Divide-and-Conquer -- 5 Probabilistic Analysis and RandomizedAlgorithms -- II Sorting and Order Statistics -- Introduction -- 6 Heapsort -- 7 QuicksortThe -- 8 Sorting in Linear Time -- 9 Medians and Order Statistics -- III Data Structures -- Introduction -- 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 -- Introduction -- 15 Dynamic Programming -- 16 Greedy Algorithms -- 17 Amortized Analysis -- V Advanced Data Structures -- Introduction -- 18 B-Trees -- 19 Fibonacci Heaps -- 20 van Emde Boas Trees -- 21 Data Structures for Disjoint Sets -- VI Graph Algorithms -- Introduction -- 22 Elementary Graph Algorithms -- 23 Minimum Spanning Trees -- 24 Single-Source Shortest Paths -- 25 All-Pairs Shortest Paths -- 26 Maximum Flow -- VII Selected Topics -- Introduction -- 27 Multithreaded AlgorithmsThe -- 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 -- Introduction -- A Summations -- B Sets, Etc. -- C Counting and Probability -- D Matrices -- Bibliography -- Index.
Počet záznamů: 1