Introduction to algorithms
Material type:
TextPublication details: Cambridge : [S.n.], c2001Edition: 2nd edDescription: xxi, 1180 p. : il. ; 24 cmISBN: - 0262032937 (MIT Press)
| Item type | Home library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Libro
|
Biblioteca de la Facultad de Informática | I.1.2 INT (Browse shelf(Opens below)) | Available | DIF-02790 | ||
|
Libro
|
Biblioteca de la Facultad de Informática | I.1.2 INT (Browse shelf(Opens below)) | Consulta en Sala | DIF-03249 |
Browsing Biblioteca de la Facultad de Informática shelves Close shelf browser (Hides shelf browser)
| I.1.2 HAR Algorithmics : the spirit of computing | I.1.2 HAR Algorithmics : the spirit of computing | I.1.2 INT Introduction to algorithms | I.1.2 INT Introduction to algorithms | I.1.2 INT Introduction to algorithms | I.1.2 INT Introduction to algorithms | I.1.2 JUS Speech language processing : An introduction to natural language processing, computational linguistics, speech recognition. |
Incluye ejercicios y problemas, bibliografía (p. 1127-1143) e índice. --
I. Foundations: The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics: heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures: Elementary data structures -- Hash tables -- Binary search trees -- red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques: Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures: B-trees -- binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- VI. Graph algoritms: Elementary graph algoritms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- VII. Select topics: Sorting networks -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix. Mathematical background: Summations -- Sets, etc. -- Counting and probability.
Click on an image to view it in the image viewer