Simplified Chernoff bounds with powers-of-two probabilities

DOI10.1016/j.ipl.2023.106397OpenAlexW4362606277MaRDI QIDQ6161458

Michael T. Goodrich, Michael B. Dillencourt

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106397

zbMATH Keywords

algorithmsanalysis of algorithmsLambert \(W\) functionalgorithm analysisChernoff bound

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the runtime and robustness of randomized broadcasting
• A guided tour of Chernoff bounds
• On the Lambert \(w\) function
• Distributed probabilistic polling and applications to proportionate agreement
• Real values of the W -function
• Efficient Gossiping by Packets in Networks with Random Faults
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Simplified Chernoff bounds with powers-of-two probabilities