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

DOI10.1016/J.COSREV.2010.03.003MaRDI QIDQ465657zbMATH OpenOpenAlexFDO

Authors J. Díaz

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

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

Recommendations

• scientific article; zbMATH DE number 1857639
• Concentration of Measure for the Analysis of Randomized Algorithms
• Concentration of measure for the analysis of randomized algorithms.
• scientific article; zbMATH DE number 5764927
• Computational Concentration of Measure: Optimal Bounds, Reductions, and More
• scientific article; zbMATH DE number 4099042
• Book Review: Kolmogorov complexity and algorithmic randomness
• A refined randomized concentration inequality
• scientific article; zbMATH DE number 7651061
• Concentration and Gaussian Approximation for Randomized Sums

Cites work

• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1857648 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 1405894 (Why is no real title available?)
• A guided tour of Chernoff bounds
• Advanced Lectures on Machine Learning
• Large deviations
• Probability and Computing
• Randomization and approximation techniques in computer science. 2nd international workshop, RANDOM '98. Barcelona, Spain, October 8--10, 1998. Proceedings
• Solutions of ordinary differential equations as limits of pure jump markov processes
• The concentration of measure phenomenon
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465657)