For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The fi...

Buy Now From Amazon

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.

  • Used Book in Good Condition
  • Used Book in Good Condition

Similar Products

Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data AnalysisApproximation AlgorithmsThe Probabilistic Method (Wiley Series in Discrete Mathematics and Optimization)Deep Learning (Adaptive Computation and Machine Learning series)Introduction to Algorithms, 3rd Edition (The MIT Press)Computational Complexity: A Modern ApproachAlgorithms Illuminated (Part 3): Greedy Algorithms and Dynamic ProgrammingCombinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)