Introduction to algorithms / Thomas H. Cormen ... [et al.]
Tipo de material:
TextoDetalles de publicación: Cambridge, Mass. : MIT Press, c2001Edición: 2nd edDescripción: xxi, 1180 p. : il. ; 24 cmISBN: - 9780262032933 (hc. : alk. paper, MIT Press)
- 9780262531962 (pb. : alk. paper, MIT Press)
- 9780070131514 (hc. : alk. paper, McGraw-Hill)
- QA 76 .6 In61962
| Tipo de ítem | Biblioteca actual | Biblioteca de origen | Colección | Signatura topográfica | Copia número | Estado | Notas | Fecha de vencimiento | Código de barras | Reserva de ítems | |
|---|---|---|---|---|---|---|---|---|---|---|---|
Libros para consulta en sala
|
Biblioteca Antonio Enriquez Savignac | Biblioteca Antonio Enriquez Savignac | COLECCIÓN RESERVA | QA 76 .6 In61962 (Navegar estantería(Abre debajo)) | 1 | No para préstamo | Ing. Telematica | 020129 |
Incluye referencias bibliográficas: p. [1127]-1143 e índice
Foundations - Introduction - The Role of Algorithms in Computing - Getting Started - Growth of Functions - Recurrences - Probabilistic Analysis and Randomized Algorithms - Sorting and Order Statistics - Introduction - Heapsort - Quicksort - Sorting in Linear Time - Medians and Order Statistics - Data Structures - Introduction - Elementary Data Structures - Hash Tables - Binary Search Trees - Red-Black Trees - Augmenting Data Structures - Advanced Design and Analysis Techniques - Introduction Dynamic Programming - Greedy Algorithms - Amortized Analysis - Advanced Data Structures - Introduction - B-Trees - Binomial Heaps - Fibonacci Heaps - Data Structures for Disjoint Sets - Graph Algorithms - Introduction - Elementary Graph Algorithms -- Minimum Spanning Trees - Single-Source Shortest Paths - All-Pairs Shortest Paths - Maximum Flow - Selected Topics - Introduction - Sorting Networks - Matrix Operations - Linear Programming - Polynomials and the FFT - Number-Theoretic Algorithms - String Matching - Computational Geometry - NP-Completeness - Aproxymation Algorithms
