Cormen, Thomas H. <br/><br/>
Introduction to algorithms 

 - 2nd ed. 
 - Cambridge :  [S.n.],  c2001 
 - xxi, 1180 p. : il.  ;  24 cm. 
<br/><br/> Incluye ejercicios y problemas, bibliografía (p. 1127-1143) e índice. -- 
<br/><br/>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. 
<br/><br/><label>ISBN: </label>0262032937 (MIT Press) 
<br/><br/><label>Standard No.: </label>DIF-M1955 
<br/><br/><label>Subjects--Topical Terms: </label><br/>ALGORITMOS<br/>PROGRAMACIÓN