Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.

DOI10.1016/J.COSREV.2010.03.003zbMath1298.00018OpenAlexW3020866076MaRDI QIDQ465657

Josep Diaz

Publication date: 24 October 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2010.03.003

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) External book reviews (00A17)

Cites Work

• A guided tour of Chernoff bounds
• Randomization and approximation techniques in computer science. 2nd international workshop, RANDOM '98. Barcelona, Spain, October 8--10, 1998. Proceedings
• Advanced Lectures on Machine Learning
• Probability and Computing
• Solutions of ordinary differential equations as limits of pure jump markov processes
• Large deviations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.