An O(n log n) algorithm for the generalized birthday problem

DOI10.1016/S0167-9473(96)00051-5zbMath0900.60010OpenAlexW2015901059WikidataQ121455363 ScholiaQ121455363MaRDI QIDQ1391985

Paul E. Wright, Frank K. Hwang

Publication date: 23 July 1998

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9473(96)00051-5

zbMATH Keywords

ClusteringComplexityReliabilityBirthday problems

Mathematics Subject Classification ID

Combinatorial probability (60C05) Reliability and life testing (62N05)

Related Items (1)

Two Birthday Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coincidence probabilities
• Computing the stationary distribution for infinite Markov chains
• A direct algorithm for computing reliability of a consecutive-k cycle
• Reliability of Consecutive-k-out-of-n:F System
• On the Consecutive-k-of-n:F System
• Fast Solutions for Consecutive-k-out-of-n: F System
• Probabilities for a Generalized Birthday Problem
• Note on a clustering problem
• Recurrent events in a Markov chain
• The first run preceded by a quota
• The Generalized Birthday Problem

This page was built for publication: An O(n log n) algorithm for the generalized birthday problem