Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Introduction to Algorithms, Second Edition

Buy
The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions.

This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials, and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveling salesman problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers.

Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions).

Considers the mathematical foundations of the analysis of algorithms and maintains this mathematical rigor throughout the work. A great resource on the basic tools used to analyze the performance of algorithms.

About the Author
Thomas H. Cormen is Associate Professor of Computer Science at Dartmouth College. Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Computer Science at the Massachusetts Institute of Technology. Clifford Stein is Associate Professor of Industrial Engineering and Operations Research at Columbia University.

(HTML tags aren't allowed.)

XSLT for Dummies
XSLT for Dummies
Harness the power of XSLT to transform XML documents

Get tips on result trees, HTML transformations, and XPath functions

The fun and easy way to exploit Extensible Stylesheet Language Transformations

With XSLT, XSL, and XPath, you can transform XML documents into HTML pages or different XML documents. With expert...

The Best Enemy Money Can Buy
The Best Enemy Money Can Buy
Back in 1973 this author published National Suicide: Military Aid to the Soviet Union, itself a sequel to a three volume academic study, Western Technology and Soviet Economic Development, published by the Hoover Institution, Stanford University. These four books are detailed verifiable catalogs of Western technology used and in use by the Soviet...
Fire the Phone Company : A Handy Guide to Voice Over IP
Fire the Phone Company : A Handy Guide to Voice Over IP
Longing to break free from the phone company's tethers? This is the place to start! Realizing that VoIP is still just an acronym to many (and an intimidating one at that), author Dave Field speaks squarely to you, the consumer, demonstrating that you don't have to be a technologist to start achieving...

El-Ahwat, A Fortified Site from the Early Iron Age Near Nahal 'Iron, Israel (Culture and History of the Ancient Near East)
El-Ahwat, A Fortified Site from the Early Iron Age Near Nahal 'Iron, Israel (Culture and History of the Ancient Near East)

Archaeological report on el-Ahwat, a mysterious but important site in the highlands of ancient Canaan. In previous publications, the author suggested that el-Ahwat may be identified with the biblical site of harosheth hagoiim (Judges 4-5).

I first heard of el-Ahwat in the summer of 1995, when I was invited to see the new site
...
Computer Architecture: Design and Performance
Computer Architecture: Design and Performance
Although computer systems employ a range of performance-improving techniques, intense effort to improve present performance and to develop completely new types of computer systems with this improved performance continues. Many design techniques involve the use of parallelism, in which more than one operation is performed...
MySQL Bible with CDROM
MySQL Bible with CDROM
"The MySQL Bible introduces the essential concepts and skills youll need to get started with MySQL." –Jeremy Zawodny, Senior Editor of Linux Magazine and the MySQL database expert at Yahoo! Finance

If MySQL can do it, you can do it too...

MySQL is the leading open source relational database management...

©2019 LearnIT (support@pdfchm.net) - Privacy Policy