000			02960cam^a2200409^a^4500
001			UDM01000140559
003			UDM
005			20211106183651.0
008			120229s2009^^^^maua^^^^^b^^^^001^0^eng^^
020			_a0262033844 _q(hardcover : alk. paper)
020			_a9780262033848 _q(hardcover : alk. paper)
040			_aDLC _beng _cDLC _dBTCTA _dYDXCP _dUKM _dC#P _dBWX _dCDX _dNLGGC _dCUV _dHEBIS _dDEBBG _dOCL _dIXA _dMNW _dMIX _dTVG _dVP@ _dBDX _dUN@
082	0	4	_a005.1 _bI61a 2009
245	1	0	_aIntroduction to algorithms / _cThomas H. Cormen ... [et al.].
250			_aThird edition
264	3	1	_aCambridge, Mass. : _bMIT Press, _cc2009.
300			_axix, 1292 páginas : _bilustraciones ; _c24 cm.
336			_atexto _btxt _2rdacontent
337			_ano mediado _bn _2rdamedia
338			_avolumen _bnc _2rdacarrier
504			_aIncluye bibliografía (p. [1231]-1250)
505	0		_aI. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- 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 -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- 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 -- Matrices.
520	3		_aThis edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover]
650	1	4	_95837 _aProgramación (Computadores electrónicos).
700	1		_985948 _aCormen, Thomas H. _eautor
856			_a_ _yTabla de contenido _uhttp://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017675862&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
900			_aDSÑ
900			_aAYN
900			_aTC
942			_2ddc _cGEN _n0
991			_aC0 _bUN@
991			_aIS _aPR12 _a000100710, Kahwati Jamal, Ghassan.
991			_aTC _aMaría del Consuelo Cabello Pinales _aOT21-1
997			_aHZ _b00 _c20140722 _lUDM01 _h1027
998			_aBATCH-UPD _b00 _c20150424 _lUDM01 _h0309
999			_c128374 _d128374