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

DOI10.1016/S0167-9473(96)00051-5zbMATH Open0900.60010OpenAlexW2015901059WikidataQ121455363 ScholiaQ121455363MaRDI QIDQ1391985FDOQ1391985

Authors: Paul 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

Recommendations

• scientific article; zbMATH DE number 58016
• A Generalized Birthday Problem
• scientific article; zbMATH DE number 1942427

zbMATH Keywords

ClusteringComplexityReliabilityBirthday problems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithmic framework for the generalized birthday problem
• A non-uniform birthday problem with applications to discrete logarithms
• Two Birthday Problems
• Refinements of the k-tree Algorithm for the Generalized Birthday Problem
• Asymptotic results for the number of Wagner's solutions to a generalised birthday problem

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

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