Efficient computation of tight approximations to Chernoff bounds

DOI10.1007/s00180-022-01219-2arXiv2109.14356OpenAlexW3201911717WikidataQ114231242 ScholiaQ114231242MaRDI QIDQ6104405

Daniel Shiu

Publication date: 15 June 2023

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.14356

zbMATH Keywords

Chernoff boundstail distributionsconcentration inequalitiesPoisson trials

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites Work

• Decryption Failure Is More Likely After Success
• Concentration of Measure for the Analysis of Randomized Algorithms
• Unnamed Item

This page was built for publication: Efficient computation of tight approximations to Chernoff bounds