On exponential bounds for binomial probabilities
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3215101 (Why is no real title available?)
- scientific article; zbMATH DE number 3196560 (Why is no real title available?)
- scientific article; zbMATH DE number 3090541 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Decision Rules, Based on the Distance, for Problems of Fit, Two Samples, and Estimation
- Decision rules, based on the distance, for the problems of independence, invariance and two samples
- On the fundamental theorem for the decision rule based on distance || ||
- Probability Inequalities for Sums of Bounded Random Variables
- Some Inequalities for Convex Functions Useful in Information Theory
- Some inequalities relating to the partial sum of binomial probabilities
Cited in
(10)- Probability inequalities with exponential bounds for \(U\)-statistics
- A Kolmogorov inequality for \(U\)-statistics based on Bernoulli kernels
- A historical perspective on Schützenberger-Pinsker inequalities
- A note on exponential bounds for binomial probabilities
- Kolmogorov inequalities for the partial sum of independent Bernoulli random variables
- On the Verification of Weighted Kripke Structures Under Uncertainty
- A log log-law for double sequences of random variables I
- A historical perspective on Schützenberger-Pinsker inequalities (extended version)
- Convergence of optimal expected utility for a sequence of binomial models
- Refined Kolmogorov inequalities for the binomial distribution
This page was built for publication: On exponential bounds for binomial probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2525492)
