Imagen de Amazon.com
Portada de Syndetics
Imagen de OpenLibrary
Introduction to algorithms Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
Series The MIT electrical engineering and computer science seriesDetalles de publicación: Cambridge, Mass. MIT Press New York McGraw-Hill 1989.Descripción: xvii, 1028 pISBN:- 0262031418
- 0070131430 (McGraw-Hill)
- 005.1 20
- QA76.6 .C662 1989
| Imagen de cubierta | Tipo de ítem | Biblioteca actual | Biblioteca de origen | Colección | Ubicación en estantería | Signatura topográfica | Materiales especificados | Info Vol | URL | Copia número | Estado | Notas | Fecha de vencimiento | Código de barras | Reserva de ítems | Prioridad de la cola de reserva de ejemplar | Reservas para cursos | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Libro | Biblioteca Encarnación Valdés Colección General bev | 005.1 C811i (Navegar estantería(Abre debajo)) | Disponible | 80000000290463 |
Total de reservas: 0
Descripciones mejoradas de Syndetics:
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers.This edition is no longer available. Please see the Second Edition of this title.
911211
Includes bibliographcal references.
Tabla de contenidos provista por Syndetics
- Preface(p. xiii)
- I Foundations
- Introduction(p. 3)
- 1 The Role of Algorithms in Computing(p. 5)
- 2 Getting Started(p. 15)
- 3 Growth of Functions(p. 41)
- 4 Recurrences(p. 62)
- 5 Probabilistic Analysis and Randomized Algorithms(p. 91)
- II Sorting and Order Statistics
- Introduction(p. 123)
- 6 Heapsort(p. 127)
- 7 Quicksort(p. 145)
- 8 Sorting in Linear Time(p. 165)
- 9 Medians and Order Statistics(p. 183)
- III Data Structures
- Introduction(p. 197)
- 10 Elementary Data Structures(p. 200)
- 11 Hash Tables(p. 221)
- 12 Binary Search Trees(p. 253)
- 13 Red-Black Trees(p. 273)
- 14 Augmenting Data Structures(p. 302)
- IV Advanced Design and Analysis Techniques
- Introduction(p. 321)
- 15 Dynamic Programming(p. 323)
- 16 Greedy Algorithms(p. 370)
- 17 Amortized Analysis(p. 405)
- V Advanced Data Structures
- Introduction(p. 431)
- 18 B-Trees(p. 434)
- 19 Binomial Heaps(p. 455)
- 20 Fibonacci Heaps(p. 476)
- 21 Data Structures for Disjoint Sets(p. 498)
- VI Graph Algorithms
- Introduction(p. 525)
- 22 Elementary Graph Algorithms(p. 527)
- 23 Minimum Spanning Trees(p. 561)
- 24 Single-Source Shortest Paths(p. 580)
- 25 All-Pairs Shortest Paths(p. 620)
- 26 Maximum Flow(p. 643)
- VII Selected Topics
- Introduction(p. 701)
- 27 Sorting Networks(p. 704)
- 28 Matrix Operations(p. 725)
- 29 Linear Programming(p. 770)
- 30 Polynomials and the FFT(p. 822)
- 31 Number-Theoretic Algorithms(p. 849)
- 32 String Matching(p. 906)
- 33 Computational Geometry(p. 933)
- 34 NP-Completeness(p. 966)
- 35 Approximation Algorithms(p. 1022)
- VIII Appendix: Mathematical Background
- Introduction(p. 1057)
- A Summations(p. 1058)
- B Sets, Etc.(p. 1070)
- C Counting and Probability(p. 1094)
- Bibliography(p. 1127)
- Index(p. 1145)
Notas de autor provistas por Syndetics
Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College.Cormen is one of the authors of Introduction to Algorithms.
(Bowker Author Biography)