Two Birthday Problems

DOI10.1080/03610920500476333zbMath1087.60013OpenAlexW1972064219MaRDI QIDQ5201501

Borek D. Puza, Terence J. O'Neill

Publication date: 19 April 2006

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610920500476333

zbMATH Keywords

combinatoricsStirling numbersinclusion-exclusion principlebirthday problems

Mathematics Subject Classification ID

Combinatorial probability (60C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items (1)

A series of two-urn biased sampling problems

Cites Work

• An O(n log n) algorithm for the generalized birthday problem
• DIRICHLET-RELATED PROBABILITY PROBLEMS AND NEW TOOLS FOR SOLVING THEM
• Unnamed Item
• Unnamed Item

This page was built for publication: Two Birthday Problems