Mitzenmacher, Michael <br/><br/>
Probability and computing :   randomized algorithms and probabilistic analysis 
Michael Mitzenmacher; Eli Upfal 
 - 2nd ed. 
 - Cambridge, United Kingdom ; New York, NY :   Cambridge University Press,   2017. 
 - xx, 467 pages :   illustrations ;   27 cm. 
<br/><br/> 1. Events and probability<br/>  2. Discrete random variables and expectations<br/>  3. Moments and deviations<br/>  4. Chernoff and Hoeffding bounds<br/>  5. Balls, bins, and random graphs<br/>  6. The probabilistic method<br/>  7. Markov chains and random walks<br/>  8. Continuous distributions and the Polsson process<br/>  9. The normal distribution<br/>  10. Entropy, randomness, and information<br/>  11. The Monte Carlo method<br/>  12. Coupling of Markov chains<br/>  13. Martingales<br/>  14. Sample complexity, VC dimension, and Rademacher complexity<br/>  15. Pairwise independence and universal hash functions<br/>  16. Power laws and related distributions<br/>  17. Balanced allocations and cuckoo hashing. 
<br/><br/> Greatly expanded, this new edition requires only an elementary background in discrete mathematics and offers a comprehensive introduction to the role of randomization and probabilistic techniques in modern computer science. Newly added chapters and sections cover topics including normal distributions, sample complexity, VC dimension, Rademacher complexity, power laws and related distributions, cuckoo hashing, and the Lovasz Local Lemma. Material relevant to machine learning and big data analysis enables students to learn modern techniques and applications. Among the many new exercises and examples are programming-related exercises that provide students with excellent training in solving relevant problems. This book provides an indispensable teaching tool to accompany a one- or two-semester course for advanced undergraduate students in computer science and applied mathematics.<br/><br/>Contains all the background in probability needed to understand many subdisciplines of computer science<br/>Includes new material relevant to machine learning and big data analysis, enabling students to learn new, up-to-date techniques and applications<br/>Newly added chapters and sections cover the normal distribution, sample complexity, VC dimension, naïve Bayes, cuckoo hashing, power laws, and the Lovasz Local Lemma<br/>Many new exercises and examples, including several new programming-related exercises, provide students with excellent training in problem solving 
<br/><br/><label>ISBN: </label>9781107154889 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science--Mathematics<br/>Probabilities<br/>Stochastic analysis<br/>Algorithms
<br/><br/><label>Dewey Class. No.: </label>518.1  / MIT