000			01856nam a2200253 a 4500
003			AR-LpUFIB
005			20250311170545.0
008			230201s2001 xxua r 000 0 eng d
020			_a0262032937 (MIT Press)
024	8		_aDIF-M1955 _b2037 _zDIF008504
040			_aAR-LpUFIB _bspa _cAR-LpUFIB
100	1		_aCormen, Thomas H.
245	1	0	_aIntroduction to algorithms
250			_a2nd ed.
260			_aCambridge : _b[S.n.], _cc2001
300			_axxi, 1180 p. : il. ; _c24 cm.
500			_aIncluye ejercicios y problemas, bibliografía (p. 1127-1143) e índice. --
505	0		_a 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.
650		4	_aALGORITMOS
650		4	_aPROGRAMACIÓN
700	1		_aLeiserson, Charles E.
700	1		_aRivest, Ronald L.
942			_cBK
999			_c58272 _d58272