Algorithm Design
- ISBN-10
- 0132131080
- ISBN-13
- 9780132131087
- Series
- Algorithm Design
- Category
- Computers
- Pages
- 984
- Language
- English
- Published
- 2011
- Publisher
- Addison-Wesley Professional
- Authors
- Jon Kleinberg, Éva Tardos
Description
'Algorithm Design' teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
Get the book
Other editions
-
- 2013-08-29
- 828 pages
- Paperback
- Pearson Higher Ed
-
- 2006
- 724 pages
- Paperback
- John Wiley & Sons
Similar books
-
The Algorithm Design Manual
By Steven S SkienaNEW to the second edition: • Doubles the tutorial material and exercises over the first edition • Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video ...
-
The Algorithm Design Manual: Text
By Steven S. SkienaThis point can be selected by p by generating the x and y coordinates independently , at random . ... From there are accessible pLab [ Lee94 ] and DIEHARD , systems for testing the quality of random number generators .
-
Algorithm Design: Foundations, Analysis, and Internet Examples
By Michael T. Goodrich, Roberto TamassiaThis book offers theoretical analysis techniques as well as algorithmic design patterns and experimental methods for the engineering of algorithms. Market: Computer Scientists; Programmers.
-
The Art of Algorithm Design
By Sachi Nandan Mohanty, Pabitra Kumar Tripathy, Suneeta SatpathyMoreover, the book provides an enjoyable primer to the field of algorithms. This book is designed for undergraduates and postgraduates studying algorithm design.
-
A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis
By Frederic Vivien, Anne Benoit, Yves Robert+ n, (S. P.,k ..) = (2 + n)Gn(z). k=1 k=1 Since G1(z) = P.12 = 2, we obtain G., (z) = 2 (2 + 1) . . . (2 + n – 1). We now need to link the value that we want to compute, namely the average complexity of Algorithm 1.3, to this function ...
-
The Ethical Algorithm: The Science of Socially Aware Algorithm Design
By Michael Kearns, Aaron RothWeaving together innovative research with stories of citizens, scientists, and activists on the front lines, The Ethical Algorithm offers a compelling vision for a future, one in which we can better protect humans from the unintended ...
-
Algorithm Design with Haskell
By Richard Bird, Jeremy GibbonsThis book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search.
-
Pearls of Functional Algorithm Design
By Richard BirdThe novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming.
-
Algorithm Design and Applications
By Michael T. Goodrich, Roberto TamassiaStudents enter the course after gaining hands-on experience with computers, and are expected to learn how algorithms can be applied to a variety of contexts. This new book integrates application with theory.
-
Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing
By Veli Mäkinen, Djamal Belazzougui, Fabio CunialThis book provides an integrated presentation of the fundamental algorithms and data structures that power modern sequence analysis workflows.