|
|
|
|
| LEADER |
03199cam a22009737a 4500 |
| 001 |
BIBLO-45814 |
| 003 |
AR-BaUEN |
| 005 |
20231109180128.0 |
| 008 |
120420s2009 enka|||f |||| 00| 0|eng|d |
| 040 |
|
|
|a AR-BaUEN
|b spa
|c AR-BaUEN
|
| 020 |
|
|
|a 9780262033848
|
| 044 |
|
|
|a xxk
|
| 080 |
|
|
|a 681.332
|
| 100 |
1 |
|
|a Cormen, Thomas H.
|4 aut
|e autor
|
| 245 |
1 |
0 |
|a Introduction to algorithms
|
| 250 |
|
|
|a 3rd. ed.
|
| 260 |
|
|
|a Cambridge, MA :
|b MIT Press,
|c c2009
|
| 300 |
|
|
|a xix, 1292 p. :
|b il.
|
| 541 |
|
|
|c CO
|a Ventura
|e Exp.: 507.764/17,O.P.: 71.298, E3,E4
|
| 541 |
|
|
|c CO
|a Ventura
|e Exp.: 503.937/14,O.P.: 70.659, E2
|
| 541 |
|
|
|c CO
|a Cuspide
|e O.P.: 69.913
|h {ARS}382;{ARS}1800; {ARS}2.950
|
| 562 |
|
|
|e 4 ej.
|
| 505 |
0 |
0 |
|t Preface
|
| 505 |
0 |
0 |
|t Introduction
|
| 505 |
0 |
0 |
|g 1
|t The Role of Algorithms in Computing
|
| 505 |
0 |
0 |
|g 2
|t Getting Started
|
| 505 |
0 |
0 |
|g 3
|t Growth of Functions
|
| 505 |
0 |
0 |
|g 4
|t Divide-and-Conquer
|
| 505 |
0 |
0 |
|g 5
|t Probabilistic Analysis and Randomized Algorithms
|
| 505 |
0 |
0 |
|t Introduction
|
| 505 |
0 |
0 |
|g 6
|t Heapsort
|
| 505 |
0 |
0 |
|g 7
|t Quicksort
|
| 505 |
0 |
0 |
|g 8
|t Sorting in Linear Time
|
| 505 |
0 |
0 |
|g 9
|t Medians and Order Statistics
|
| 505 |
0 |
0 |
|t Introduction
|
| 505 |
0 |
0 |
|g 10
|t Elementary Data Structures
|
| 505 |
0 |
0 |
|g 11
|t Hash Tables
|
| 505 |
0 |
0 |
|g 12
|t Binary Search Trees
|
| 505 |
0 |
0 |
|g 13
|t Red-Black Trees
|
| 505 |
0 |
0 |
|g 14
|t Augmenting Data Structures
|
| 505 |
0 |
0 |
|t Introduction
|
| 505 |
0 |
0 |
|g 15
|t Dynamic Programming
|
| 505 |
0 |
0 |
|g 16
|t Greedy Algorithms
|
| 505 |
0 |
0 |
|g 17
|t Amortized Analysis
|
| 505 |
0 |
0 |
|t Introduction
|
| 505 |
0 |
0 |
|g 18
|t B-Trees
|
| 505 |
0 |
0 |
|g 19
|t Fibonacci Heaps
|
| 505 |
0 |
0 |
|g 20
|t van Emde Boas Trees
|
| 505 |
0 |
0 |
|g 21
|t Data Structures for Disjoint Sets
|
| 505 |
0 |
0 |
|t Introduction
|
| 505 |
0 |
0 |
|g 22
|t Elementary Graph Algorithms
|
| 505 |
0 |
0 |
|g 23
|t Minimun Spanning Trees
|
| 505 |
0 |
0 |
|g 24
|t Single-Source Paths
|
| 505 |
0 |
0 |
|g 25
|t All-Pairs Shortest Paths
|
| 505 |
0 |
0 |
|g 26
|t Maximum Flow
|
| 505 |
0 |
0 |
|t Introduction
|
| 505 |
0 |
0 |
|g 27
|t Multithreaded Algorithms
|
| 505 |
0 |
0 |
|g 28
|t Matrix Operations
|
| 505 |
0 |
0 |
|g 29
|t Linear Programming
|
| 505 |
0 |
0 |
|g 30
|t Polynomials and the FFT
|
| 505 |
0 |
0 |
|g 31
|t Number-Theoretic Algorithms
|
| 505 |
0 |
0 |
|g 32
|t String Matching
|
| 505 |
0 |
0 |
|g 33
|t Computational Geometry
|
| 505 |
0 |
0 |
|g 34
|t NP-Completeness
|
| 505 |
0 |
0 |
|g 35
|t Approximation Algorithms
|
| 505 |
0 |
0 |
|t Introduction
|
| 505 |
0 |
0 |
|g A
|t Summations
|
| 505 |
0 |
0 |
|g B
|t Sets, Etc.
|
| 505 |
0 |
0 |
|g C
|t Counting and Probability
|
| 505 |
0 |
0 |
|g D
|t Matrices
|
| 505 |
0 |
0 |
|t Bibliography
|
| 505 |
0 |
0 |
|t Index
|
| 691 |
|
7 |
|2 fcen-at
|a computacion
|
| 650 |
1 |
7 |
|2 spines
|a ALGORITMOS
|
| 700 |
1 |
|
|a Leiserson, Charles E.
|4 aut
|e autor
|
| 700 |
1 |
|
|a Rivest, Ronald L.
|4 aut
|e autor
|
| 700 |
1 |
|
|a Stein, Clifford
|4 aut
|e autor
|
| 901 |
|
|
|a BIBLO
|b 00045944
|o SILVINA
|o NOEMI
|o NOEMI
|n 54774
|q Camila Rocio Gonzalez
|
| 931 |
|
|
|a DC
|b ALGORITMOS
|b ESTRUCTURA DE DATOS II
|b ALGORITMOS
|b ALGORITMOS I
|b ALGORITMOS II
|b ALGORITMOS III
|
| 942 |
|
|
|2 udc
|n 0
|0 84
|
| 962 |
|
|
|a info:eu-repo/semantics/book
|a info:ar-repo/semantics/libro
|b info:eu-repo/semantics/publishedVersion
|
| 976 |
|
|
|a AEX
|
| 997 |
|
|
|a MONOGRAF
|
| 999 |
|
|
|c 36019
|d 36019
|