|
| Título : |
Introduction to algorithms |
| Tipo de documento: |
texto impreso |
| Autores: |
Thomas H. Cormen,, Autor ; Charles E. Leiserson, Autor ; Charles E. Leiserson, Autor ; Charles E. Leiserson, Autor ; Ronald L. Rivest, Autor ; Ronald L. Rivest, Autor ; Ronald L. Rivest, Autor |
| Mención de edición: |
Tercera edición |
| Editorial: |
Massachusetts : The Mit Press |
| Fecha de publicación: |
2009 |
| Número de páginas: |
xix, 1292 páginas |
| Il.: |
diagramas, tablas |
| Dimensiones: |
25 cm |
| ISBN/ISSN/DL: |
978-0-262-03384-8 |
| Nota general: |
Incluye referencias bibliográficas |
| Idioma : |
Inglés (eng) |
| Clasificación: |
637.302 |
| Nota de contenido: |
I.Foundations: Introduction -- The role of algorits in computing -- Getting started -- Growth of function -- Divide-and-conquer -- Probabilistic anlysis and randomized algorithms -- II.Sorting and order statics: Introduction -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order Statistics -- III.Data structures: Introduction -- Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV.Acvanced desing and analysis techniques: Introduction -- Dynamic programming -- Greedy algorithms -- Amortized analysis -- V.Advanced data structure: Introduction -- B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI.Graph algorithms: Introduction -- Elentary graph algorithms -- Minimum sapanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- VII.Selected topics: Introduction -- Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms. |
| Link: |
https://biblioteca.unap.edu.pe/opac_css/index.php?lvl=notice_display&id=106631 |
Introduction to algorithms [texto impreso] / Thomas H. Cormen,, Autor ; Charles E. Leiserson, Autor ; Charles E. Leiserson, Autor ; Charles E. Leiserson, Autor ; Ronald L. Rivest, Autor ; Ronald L. Rivest, Autor ; Ronald L. Rivest, Autor . - Tercera edición . - Massachusetts : The Mit Press, 2009 . - xix, 1292 páginas : diagramas, tablas ; 25 cm. ISBN : 978-0-262-03384-8 Incluye referencias bibliográficas Idioma : Inglés ( eng)
| Clasificación: |
637.302 |
| Nota de contenido: |
I.Foundations: Introduction -- The role of algorits in computing -- Getting started -- Growth of function -- Divide-and-conquer -- Probabilistic anlysis and randomized algorithms -- II.Sorting and order statics: Introduction -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order Statistics -- III.Data structures: Introduction -- Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV.Acvanced desing and analysis techniques: Introduction -- Dynamic programming -- Greedy algorithms -- Amortized analysis -- V.Advanced data structure: Introduction -- B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI.Graph algorithms: Introduction -- Elentary graph algorithms -- Minimum sapanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- VII.Selected topics: Introduction -- Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms. |
| Link: |
https://biblioteca.unap.edu.pe/opac_css/index.php?lvl=notice_display&id=106631 |
Introduction to algorithms
Cormen,, Thomas H.Leiserson, Charles E. ; Leiserson, Charles E. ; Leiserson, Charles E. ; Rivest, Ronald L. ; Rivest, Ronald L. ; Rivest, Ronald L. - -
Massachusetts : The Mit Press - 2009
Incluye referencias bibliográficas
I.Foundations: Introduction -- The role of algorits in computing -- Getting started -- Growth of function -- Divide-and-conquer -- Probabilistic anlysis and randomized algorithms -- II.Sorting and order statics: Introduction -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order Statistics -- III.Data structures: Introduction -- Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV.Acvanced desing and analysis techniques: Introduction -- Dynamic programming -- Greedy algorithms -- Amortized analysis -- V.Advanced data structure: Introduction -- B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI.Graph algorithms: Introduction -- Elentary graph algorithms -- Minimum sapanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- VII.Selected topics: Introduction -- Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.
|
|  |
Hacer una sugerencia Refinar búsqueda
