Introduction to algorithms / Thomas H. Cormen ... [et al.] [Texto impreso]
Contributor(s): Cormen, Thomas H
| Leiserson, Charles E | Rivest, Ronald. L | Stein, CliffordOriginal language: English Publisher: Cambridge (Massachusetts) [etc.] : MIT Press ; cop. 2009Edition: 3rd. edDescription: xxi, 1292 p. : gráf. ; 23 cmISBN: 9780262033848Subject(s): Algoritmos | Programación de ordenadores| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Course reserves |
|---|---|---|---|---|---|---|---|
Libro
|
Biblioteca Universidad Europea del Atlántico Fondo General | No ficción | 519.7 INT | Available | 3969 | ||
|
Libro
|
Biblioteca Universidad Europea del Atlántico Fondo General | No ficción | 519.7 INT | Available | 3915 |
Bibliografía: p. [1231]-1250
1 The Role of Algorithms in Computing ;
2 Getting Started ;
3 Growth of Functions ;
4 Divide-and-Conquer ;
5 Probabilistic Analysis and Randomized Algorithms ;
6 Heapsort ;
7 Quicksort ;
8 Sorting in Linear Time ;
9 Medians and Order Statistics ;
11 Hash Tables ;
12 Binary Search Treesv
13 Red-Black Trees ;
14 Augmenting Data Structures ;
15 Dynamic Programming ;
16 Greedy Algorithms ;
17 Amortized Analysis ;
18 B-Trees ;
19 Fibonacci Heaps ;
20 van Emde Boas Trees ;
21 Data Structures for Disjoint Sets ;
22 Elementary Graph Algorithmsv
23 Minimum Spanning Trees ;
24 Single-Source Shortest Pathsv
25 All-Pairs Shortest Paths ;
26 Maximum Flow ;
27 Multithreaded Algorithms ;
28 Matrix Operations ;
29 Linear Programming ;
30 Polynomials and the FFT ;
30.1 Representing polynomials ;
30.2 The DFT and FFT ;
30.3 Efficient FFT implementations ;
31 Number-Theoretic Algorithms ;
32 String Matching ;
33 Computational Geometry ;
34 NP-Completeness ;
35 Approximation Algorithms.