|
|
|
|
LEADER |
00000nam a2200000 a 4500 |
003 |
AR-LpUFIB |
005 |
20250423183320.0 |
008 |
230201s2001 xxua r 000 0 eng d |
020 |
|
|
|a 0262032937 (MIT Press)
|
024 |
8 |
|
|a DIF-M1955
|b 2037
|z DIF008504
|
040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
100 |
1 |
|
|a Cormen, Thomas H.
|9 50859
|
245 |
1 |
0 |
|a Introduction to algorithms
|
250 |
|
|
|a 2nd ed.
|
260 |
|
|
|a Cambridge :
|b [S.n.],
|c c2001
|
300 |
|
|
|a xxi, 1180 p. : il. ;
|c 24 cm.
|
500 |
|
|
|a Incluye 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 |
|a ALGORITMOS
|9 42858
|
650 |
|
4 |
|a PROGRAMACIÓN
|9 42809
|
700 |
1 |
|
|a Leiserson, Charles E.
|9 50860
|
700 |
1 |
|
|a Rivest, Ronald L.
|9 50861
|
942 |
|
|
|c BK
|
952 |
|
|
|0 0
|1 0
|4 0
|6 I12_INT
|7 0
|9 85014
|a DIF
|b DIF
|d 2025-03-11
|i DIF-02790
|l 0
|o I.1.2 INT
|p DIF-02790
|r 2025-03-11 17:05:45
|w 2025-03-11
|y BK
|
952 |
|
|
|0 0
|1 0
|4 0
|6 I12_INT
|7 1
|9 85015
|a DIF
|b DIF
|d 2025-03-11
|i DIF-03249
|l 0
|o I.1.2 INT
|p DIF-03249
|r 2025-03-11 17:05:45
|w 2025-03-11
|y BK
|
999 |
|
|
|c 58272
|d 58272
|