Randomized Algorithms

Nonfiction, Computers, Advanced Computing, Computer Science, General Computing, Programming
Cover of the book Randomized Algorithms by Rajeev Motwani, Prabhakar Raghavan, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Rajeev Motwani, Prabhakar Raghavan ISBN: 9781139635929
Publisher: Cambridge University Press Publication: August 25, 1995
Imprint: Cambridge University Press Language: English
Author: Rajeev Motwani, Prabhakar Raghavan
ISBN: 9781139635929
Publisher: Cambridge University Press
Publication: August 25, 1995
Imprint: Cambridge University Press
Language: English

For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.

More books from Cambridge University Press

Cover of the book Shakespeare Beyond Doubt by Rajeev Motwani, Prabhakar Raghavan
Cover of the book The Missing Lemur Link by Rajeev Motwani, Prabhakar Raghavan
Cover of the book The Cambridge Handbook of Creativity by Rajeev Motwani, Prabhakar Raghavan
Cover of the book Natural Disasters in the Ottoman Empire by Rajeev Motwani, Prabhakar Raghavan
Cover of the book The Spirit of Mourning by Rajeev Motwani, Prabhakar Raghavan
Cover of the book Advanced Engineering Dynamics by Rajeev Motwani, Prabhakar Raghavan
Cover of the book The Neotoma Paleoecology Database by Rajeev Motwani, Prabhakar Raghavan
Cover of the book Governing with Words by Rajeev Motwani, Prabhakar Raghavan
Cover of the book World War I and the American Constitution by Rajeev Motwani, Prabhakar Raghavan
Cover of the book The Monks of Tiron by Rajeev Motwani, Prabhakar Raghavan
Cover of the book Essential Bioinformatics by Rajeev Motwani, Prabhakar Raghavan
Cover of the book The Cambridge Companion to Rabelais by Rajeev Motwani, Prabhakar Raghavan
Cover of the book The Cambridge Companion to English Literature, 1650–1740 by Rajeev Motwani, Prabhakar Raghavan
Cover of the book Spinoza's 'Theological-Political Treatise' by Rajeev Motwani, Prabhakar Raghavan
Cover of the book Macroeconomics for MBAs and Masters of Finance by Rajeev Motwani, Prabhakar Raghavan
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy