A reference source on the probabilistic analysis of algorithms, this book focuses on one powerful class of algorithm, and explores methods of analyzing the data. It presents a body of information that integrates probability theory and computer science in the distributional theory of algorithms, and shows professional programmers how randomness can be effectively used to design more efficient programs. An introduction to mathematical tools, exercises and an extensive bibliography are included.
Read More
A reference source on the probabilistic analysis of algorithms, this book focuses on one powerful class of algorithm, and explores methods of analyzing the data. It presents a body of information that integrates probability theory and computer science in the distributional theory of algorithms, and shows professional programmers how randomness can be effectively used to design more efficient programs. An introduction to mathematical tools, exercises and an extensive bibliography are included.
Read Less
