metalero87 Posted November 20, 2011 Report Share Posted November 20, 2011 No sé si corresponde a esta sección al no haber lugar para libros de informatica, en tal caso mis disculpas :) Año: 2009Autores: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford SteinPaginas: 1313Formato: pdf Table of ContentsContentsPreface I Foundations* 1 The Role of Algorithms in Computingo 1.1 Algorithmso 1.2 Algorithms as a technologyo Problemso Chapter notes* 2 Getting Startedo 2.1 Insertion sorto 2.2 Analyzing algorithmso 2.3 Designing algorithmso Problemso Chapter notes* 3 Growth of Functionso 3.1 Asymptotic notationo 3.2 Standard notations and common functionso Problemso Chapter notes* 4 Divide-and-Conquero 4.1 The maximum-subarray problemo 4.2 Strassen’s algorithm for matrix multiplicationo 4.3 The substitution method for solving recurrenceso 4.4 The recursion-tree method for solving recurrenceso 4.5 The master method for solving recurrenceso 4.6 Proof of the master theoremo Problemso Chapter notes* 5 Probabilistic Analysis and Randomized Algorithmso 5.1 The hiring problemo 5.2 Indicator random variableso 5.3 Randomized algorithmso 5.4 Probabilistic analysis and further uses of indicator random variableso Problemso Chapter notes II Sorting and Order Statistics* 6 Heapsorto 6.1 Heapso 6.2 Maintaining the heap propertyo 6.3 Building a heapo 6.4 The heapsort algorithmo 6.5 Priority queueso Problemso Chapter notes* 7 Quicksorto 7.1 Description of quicksorto 7.2 Performance of quicksorto 7.3 A randomized version of quicksorto 7.4 Analysis of quicksorto Problemso Chapter notes* 8 Sorting in Linear Timeo 8.1 Lower bounds for sortingo 8.2 Counting sorto 8.3 Radix sorto 8.4 Bucket sorto Problemso Chapter notes* 9 Medians and Order Statisticso 9.1 Minimum and maximumo 9.2 Selection in expected linear timeo 9.3 Selection in worst-case linear timeo Problemso Chapter notes III Data Structures* 10 Elementary Data Structureso 10.1 Stacks and queueso 10.2 Linked listso 10.3 Implementing pointers and objectso 10.4 Representing rooted treeso Problemso Chapter notes* 11 Hash Tableso 11.1 Direct-address tableso 11.2 Hash tableso 11.3 Hash functionso 11.4 Open addressingo 11.5 Perfect hashingo Problemso Chapter notes* 12 Binary Search Treeso 12.1 What is a binary search tree?o 12.2 Querying a binary search treeo 12.3 Insertion and deletiono 12.4 Randomly built binary search treeso Problemso Chapter notes* 13 Red-Black Treeso 13.1 Properties of red-black treeso 13.2 Rotationso 13.3 Insertiono 13.4 Deletiono Problemso Chapter notes* 14 Augmenting Data Structureso 14.1 Dynamic order statisticso 14.2 How to augment a data structureo 14.3 Interval treeso Problemso Chapter notes IV Advanced Design and Analysis Techniques* 15 Dynamic Programmingo 15.1 Rod cuttingo 15.2 Matrix-chain multiplicationo 15.3 Elements of dynamic programmingo 15.4 Longest common subsequenceo 15.5 Optimal binary search treeso Problemso Chapter notes* 16 Greedy Algorithmso 16.1 An activity-selection problemo 16.2 Elements of the greedy strategyo 16.3 Huffman codeso 16.4 Matroids and greedy methodso 16.5 A task-scheduling problem as a matroido Problemso Chapter notes* 17 Amortized Analysiso 17.1 Aggregate analysiso 17.2 The accounting methodo 17.3 The potential methodo 17.4 Dynamic tableso Problemso Chapter notes V Advanced Data Structures* 18 B-Treeso 18.1 De.nition of B-treeso 18.2 Basic operations on B-treeso 18.3 Deleting a key from a B-treeo Problemso Chapter notes* 19 Fibonacci Heapso 19.1 Structure of Fibonacci heapso 19.2 Mergeable-heap operationso 19.3 Decreasing a key and deleting a nodeo 19.4 Bounding the maximum degreeo Problemso Chapter notes* 20 van Emde Boas Treeso 20.1 Preliminary approacheso 20.2 A recursive structureo 20.3 The van Emde Boas treeo Problemso Chapter notes* 21 Data Structures for Disjoint Setso 21.1 Disjoint-set operationso 21.2 Linked-list representation of disjoint setso 21.3 Disjoint-set forestso 21.4 Analysis of union by rank with path compressiono Problemso Chapter notes VI Graph Algorithms* 22 Elementary Graph Algorithmso 22.1 Representations of graphso 22.2 Breadth-.rst searcho 22.3 Depth-.rst searcho 22.4 Topological sorto 22.5 Strongly connected componentso Problemso Chapter notes* 23 Minimum Spanning Treeso 23.1 Growing a minimum spanning treeo 23.2 The algorithms of Kruskal and Primo Problemso Chapter notes* 24 Single-Source Shortest Pathso 24.1 The Bellman-Ford algorithmo 24.2 Single-source shortest paths in directed acyclic graphso 24.3 Dijkstra’s algorithmo 24.4 Difference constraints and shortest pathso 24.5 Proofs of shortest-paths propertieso Problemso Chapter notes* 25 All-Pairs Shortest Pathso 25.1 Shortest paths and matrix multiplicationo 25.2 The Floyd-Warshall algorithmo 25.3 Johnson’s algorithm for sparse graphso Problemso Chapter notes* 26 Maximum Flowo 26.1 Flow networkso 26.2 The Ford-Fulkerson methodo 26.3 Maximum bipartite matchingo 26.4 Push-relabel algorithmso 26.5 The relabel-to-front algorithmo Problemso Chapter notes VII Selected Topics* 27 Multithreaded Algorithmso 27.1 The basics of dynamic multithreadingo 27.2 Multithreaded matrix multiplicationo 27.3 Multithreaded merge sorto Problemso Chapter notes* 28 Matrix Operationso 28.1 Solving systems of linear equationso 28.2 Inverting matriceso 28.3 Symmetric positive-de.nite matrices and least-squares approximationo Problemso Chapter notes* 29 Linear Programmingo 29.1 Standard and slack formso 29.2 Formulating problems as linear programso 29.3 The simplex algorithmo 29.4 Dualityo 29.5 The initial basic feasible solutiono Problemso Chapter notes* 30 Polynomials and the FFTo 30.1 Representing polynomialso 30.2 The DFT and FFTo 30.3 Ef.cient FFT implementationso Problemso Chapter notes* 31 Number-Theoretic Algorithmso 31.1 Elementary number-theoretic notionso 31.2 Greatest common divisoro 31.3 Modular arithmetico 31.4 Solving modular linear equationso 31.5 The Chinese remainder theoremo 31.6 Powers of an elemento 31.7 The RSA public-key cryptosystemo 31.8 Primality testingo 31.9 Integer factorizationo Problemso Chapter notes* 32 String Matchingo 32.1 The naive string-matching algorithmo 32.2 The Rabin-Karp algorithmo 32.3 String matching with .nite automatao 32.4 The Knuth-Morris-Pratt algorithmo Problemso Chapter notes* 33 Computational Geometryo 33.1 Line-segment propertieso 33.2 Determining whether any pair of segments intersectso 33.3 Finding the convex hullo 33.4 Finding the closest pair of pointso Problemso Chapter notes* 34 NP-Completenesso 34.1 Polynomial timeo 34.2 Polynomial-time veri.cationo 34.3 NP-completeness and reducibilityo 34.4 NP-completeness proofso 34.5 NP-complete problemso Problemso Chapter notes* 35 Approximation Algorithmso 35.1 The vertex-cover problemo 35.2 The traveling-salesman problemo 35.3 The set-covering problemo 35.4 Randomization and linear programmingo 35.5 The subset-sum problemo Problemso Chapter notes VIII Appendix: Mathematical Background* A Summationso A.1 Summation formulas and propertieso A.2 Bounding summationso Problemso Appendix notes* B Sets, Etc.o B.1 Setso B.2 Relationso B.3 Functionso B.4 Graphso B.5 Treeso Problemso Appendix notes* C Counting and Probabilityo C.1 Countingo C.2 Probabilityo C.3 Discrete random variableso C.4 The geometric and binomial distributionso C.5 The tails of the binomial distributiono Problemso Appendix notes* D Matriceso D.1 Matrices and matrix operationso D.2 Basic matrix propertieso Problemso Appendix notesBibliographyIndex http://www.fileserve.com/file/yfGFGUC Pass: www.chilecomparte.cl Link to comment Share on other sites More sharing options...
fperez777 Posted November 24, 2011 Report Share Posted November 24, 2011 excelente aporte se agradece Link to comment Share on other sites More sharing options...
metalero87 Posted December 7, 2011 Author Report Share Posted December 7, 2011 que le saques provecho amigo, este libro es uno de los mejores sobre algoritmos! Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now