Couverture : Probability and Computing

Couverture : Open Library

← Fiche de l'œuvre

Probability and Computing

Randomized Algorithms and Probabilistic Analysis

Michael Mitzenmacher, Eli Upfal

Résumé

Randomization and probabilistic techniques play an important role in modern computer science, with applications ranging from combinatorial optimization and machine learning to communication networks and secure protocols. This 2005 textbook is designed to accompany a one- or two-semester course for advanced undergraduates or beginning graduate students in computer science and applied mathematics. It gives an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It assumes only an elementary background in discrete mathematics and gives a rigorous yet accessible treatment of the material, with numerous examples and applications. The first half of the book covers core material, including random sampling, expectations, Markov's inequality, Chevyshev's inequality, Chernoff bounds, the probabilistic method and Markov chains. The second half covers more advanced topics such as continuous probability, applications of limited independence, entropy, Markov chain Monte Carlo methods and balanced allocations. With its comprehensive selection of topics, along with many examples and exercises, this book is an indispensable teaching tool.

Détails de l'édition

ISBN-13
9780521835404
ISBN-10
0521835402
EAN
9780521835404
Éditeur
Cambridge university press (Cambridge)
Date de publication
31 janvier 2005
Langue
en
Pages
372
Dimensions
26 cm
Provenance des données
  • dimensions BnF Catalogue général · 23 juillet 2026
  • language Google Books · 4 novembre 2026
  • page_count Google Books · 4 novembre 2026
  • publication_date Google Books · 4 novembre 2026
  • subtitle Google Books · 4 novembre 2026
  • summary Google Books · 4 novembre 2026
  • title Google Books · 4 novembre 2026