Posted by **roxul** at May 23, 2016

English | ISBN: 0199456666 | 2015 | 692 pages | PDF | 66 MB

Posted by **ParRus** at May 3, 2015

English | MP4 + PDF slides | 960 x 540 | AVC ~22.2 kbps | 15 fps

AAC | 128 Kbps | 44.1 KHz | 2 channels | Subs: English (srt) | ~19 hours | 1.24 GB

AAC | 128 Kbps | 44.1 KHz | 2 channels | Subs: English (srt) | ~19 hours | 1.24 GB

In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures.

Posted by **ParRus** at June 6, 2013

English | MP4 | 960 x 540 | AVC ~22.1 kbps | 15 fps

AAC | 122 Kbps | 44.1 KHz | 2 channels | Subs: English (srt) | 19:04:49 | 1.52 GB

AAC | 122 Kbps | 44.1 KHz | 2 channels | Subs: English (srt) | 19:04:49 | 1.52 GB

In this course you will learn several fundamental principles of advanced algorithm design. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression. You'll learn the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments.

Posted by **house23** at April 11, 2013

MP4 | AVC 21kbps | English | 960x540 | 15fps | 19 hours | AAC stereo 114kbps | 1.24 GB

In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?

Posted by **ChrisRedfield** at Dec. 2, 2015

Published: 2011-11-17 | ISBN: 1461417007 | PDF | 440 pages | 2.87 MB

Posted by **ph4rr3l** at Dec. 26, 2013

Published: November 18, 2011 | ISBN: 1461417007 | PDF | 451 pages | 3 MB

When precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for researchers in the area of design and analysis algorithms. There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, enabling the reader to study algorithms of the same nature with ease, and providing an improved understanding of the design and analysis techniques for approximation algorithms. Instructors benefit from this approach allowing for an easy way to present the ideas and techniques of algorithms with a unified approach.

Posted by **nebulae** at Feb. 15, 2013

English | 2011 | 592 Pages | ISBN: 0132316811 | PDF | 10 MB

Posted by **interes** at Sept. 11, 2012

English | 3 edition 2011 | 592 Pages | ISBN: 0132316811 | PDF | 2 MB

Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.

Posted by **FenixN** at May 21, 2012

62xWebM / VP8, ~122 kb/s | 960x540 | Duration: N/A | English: Vorbis, 128 kb/s (2 ch) | 3.97 GB

In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?

Posted by **tukotikko** at April 22, 2012

2 edition 2007 | 590 Pages | ISBN: 0321364139 | PDF | 19 MB