TY  - BOOK
AU  - Cormen,Thomas H.
AU  - Leiserson,Charles E.
AU  - Rivest,Ronald L.
TI  - Introduction to algorithms
SN  - 0262032937 (MIT Press)
PY  - 2001///
CY  - Cambridge
PB  - [S.n.]
KW  - ALGORITMOS
KW  - PROGRAMACIÓN
N1  - 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
ER  -