REVIEW 2 cited by
Hypergeometric tail inequalities: ending the insanity
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
The hypergeometric distribution is briefly and informally surveyed, including popular notation, symmetries, and the tail inequalities $Pr[i \ge E[i]+tn] \le e^{-2t^2n}$ and $Pr[i \le E[i]-tn] \le e^{-2t^2n}$.
Forward citations
Cited by 2 Pith papers
-
Bicriteria Submodular Maximization
Near-optimal bicriteria approximation algorithms with matching hardness for constrained submodular maximization, spanning cardinality, knapsack, matroid and convex-set constraints and monotone, general and symmetric o...
-
An Optimal Sorting Algorithm for Persistent Random Comparison Faults
RiffleSort sorts n elements with persistent random comparison errors (p<1/4) in O(n log n) time with O(log n) maximum and O(n) total dislocation, with matching lower bounds.
Discussion (0). Sign in to comment.