Introduction to algorithms /

Mostrar otras versiones (1)

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of reader...

Descripción completa

Detalles Bibliográficos
Clasificación:QA76.6 C6.75 2009
Autor principal: Cormen, Thomas H. (autor)
Otros Autores: Rivest, Ronald L. (autor), Stein, Clifford (autor), Leiserson, Charles Eric (autor)
Formato: Libro
Idioma:Inglés
Publicado: Cambridge, Massachusetts : MIT Press, [2009].
Edición:Third edition
Temas:
Computer programming
Computadoras > Programación
Computer algorithms
Algoritmos computacionales

MARC

LEADER 00000cam a2200000 i 4500
001 000155366
005 20151014105620.0
007 ta
008 090226s2009 maua g b 001 0 eng
020 |a 9780262033848 
040 |a OCLCQ  |b sps  |e rda  |d OCLCO  |d CHVBK  |d MX-MxUAM 
041 0 |a eng 
050 4 |a QA76.6  |b C6.75 2009 
090 |a QA76.6  |b C6.75 2009 
100 1 |a Cormen, Thomas H.,  |e autor 
245 1 0 |a Introduction to algorithms /  |c Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. 
250 |a Third edition 
264 1 |a Cambridge, Massachusetts :  |b MIT Press,  |c [2009]. 
264 4 |a ©2009. 
300 |a xix, 1292 páginas :  |b ilustraciones ;  |c 24 cm. 
336 |a texto  |b txt  |2 rdacontent 
337 |a sin medio  |b n  |2 rdamedia 
338 |a volumen  |b nc  |2 rdacarrier 
504 |a Incluye referencias bibliográficas (páginas [1231]-1250) e índice 
505 2 0 |g 1.  |t The role of algorithms in computing.--  |t Getting started.--  |t Growth of functions.--  |t Divide-and-conquer.--  |t Probabilistic analysis and randomized algorithms.--  |g II.  |t Sorting and order statistics. Heapsort.--  |t Quicksort.--  |t Sorting in linear time.--  |t Medians and order statistics.--  |g III.  |t Data structures.--  |t Elementary data structures.--  |t Hash tables.--  |t Binary search trees.--  |t Red-black trees.--  |t Augmenting data structures.--  |g IV.  |t Advanced design and analysis techniques.--  |a Dynamic programming.--  |t Greedy algorithms.--  |t Amortized analysis.--  |g V.  |t Advanced data structures.--  |t B-trees.--  |t Fibonacci heaps.--  |t van Emde Boas trees.--  |t Data structures for disjoint sets.--  |g VI.  |t Graph algorithms.--  |t Elementary graph algorithms.--  |t Minimum spanning trees.--  |t Single-source shortest paths.--  |t All-pairs shortest paths.--  |t Maximun flow.--  |g VII.  |t Selected topics.--  |t Multithreaded algorithms.--  |t Matrix operations.--  |t Linear programming.--  |t Polynomials and the FFT.--  |t Number-theoretic algorithms.--  |t String matching.--  |t Computational geometry.--  |t NP-completeness.--  |t Approximation algorithms.--  |g VIII.  |t Appendix: Mathematical background. Summations.--  |t Sets, etc.--  |t Counting and probability.--  |t Matrices. 
520 1 |a Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. 
538 |a CSH / w297652-w297653 / c.1-c.2 
650 0 |a Computer programming 
650 4 |a Computadoras  |x Programación 
650 0 |a Computer algorithms 
650 4 |a Algoritmos computacionales 
700 1 |a Rivest, Ronald L.,  |e autor 
700 1 |a Stein, Clifford,  |e autor 
700 1 |a Leiserson, Charles Eric,  |e autor 
938 |a CBI 
949 |a Biblioteca UAM Iztapalapa  |b Colección General  |c QA76.6 C6.75 2009 

Ejemplares similares