Introduction to algorithms
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Libro |
| Lenguaje: | Inglés |
| Publicado: |
Cambridge, MA :
MIT Press,
c2009
|
| Edición: | 3rd. ed. |
| Materias: | |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
Tabla de Contenidos:
- Preface
- Introduction
- 1 The Role of Algorithms in Computing
- 2 Getting Started
- 3 Growth of Functions
- 4 Divide-and-Conquer
- 5 Probabilistic Analysis and Randomized Algorithms
- Introduction
- 6 Heapsort
- 7 Quicksort
- 8 Sorting in Linear Time
- 9 Medians and Order Statistics
- Introduction
- 10 Elementary Data Structures
- 11 Hash Tables
- 12 Binary Search Trees
- 13 Red-Black Trees
- 14 Augmenting Data Structures
- Introduction
- 15 Dynamic Programming
- 16 Greedy Algorithms
- 17 Amortized Analysis
- Introduction
- 18 B-Trees
- 19 Fibonacci Heaps
- 20 van Emde Boas Trees
- 21 Data Structures for Disjoint Sets
- Introduction
- 22 Elementary Graph Algorithms
- 23 Minimun Spanning Trees
- 24 Single-Source Paths
- 25 All-Pairs Shortest Paths
- 26 Maximum Flow
- Introduction
- 27 Multithreaded Algorithms
- 28 Matrix Operations
- 29 Linear Programming
- 30 Polynomials and the FFT
- 31 Number-Theoretic Algorithms
- 32 String Matching
- 33 Computational Geometry
- 34 NP-Completeness
- 35 Approximation Algorithms
- Introduction
- A Summations
- B Sets, Etc.
- C Counting and Probability
- D Matrices
- Bibliography
- Index