000			00977nam a22002414a 4500
001			PE-BaUNAB
005			20260623165349.0
006			a||||gr|||| 001 0
007			ta
008			t pe gr 00| 0 spa d
020			_a9780262518802
040			_aPE-BaUNAB
041			_aspa
043			_cper
082			_a005.1
100			_aCormen, Thomas H _eAutor _912502
245			_aAlgorithms unlocked
260			_aCambridge, _bMassachusetts : The MIT Press, _c2013.
300			_a222 pages : _c23 cm.
505			_aPreface -- What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems -- Bibliography -- Index.
650			_aComputer algorithms _913729
942			_2ddc _cLIB _e2026-06-23 _zLRM
999			_c6070 _d6070