The Generalized Birthday Problem

DOI10.2307/2284398MaRDI QIDQ5649256zbMATH OpenOpenAlexFDO

Authors Bernard Saperstein

Publication date 1972

Full work available at URL https://doi.org/10.2307/2284398

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03)

Cited in

(11)

• Discrete problems in probability theory
• The number of dense arrangements
• On a waiting time distribution in a sequence of Bernoulli trials
• An O(n log n) algorithm for the generalized birthday problem
• Runs, scans and urn model distributions: A unified Markov chain approach
• Discrete scan statistics generated by exchangeable binary trials
• Combined \(m\)-consecutive and \(k\)-out-of-\(n\) sliding window systems
• Multiple window discrete scan statistic for higher-order Markovian sequences
• A note on the exponentiation approximation of the birthday paradox
• A groupwise approach to the birthday paradox
• Uneven allocation of elements in linear multi-state sliding window system

This page was built for publication: The Generalized Birthday Problem

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