Probabilities for a Generalized Birthday Problem

DOI10.2307/2286023zbMATH Open0292.60032OpenAlexW4239682326MaRDI QIDQ4043840FDOQ4043840

Authors: Joseph Naus 

Publication date: 1974

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

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Survival analysis and censored data (62N99)

Cited In (21)

• Sequential Window Problems
• An O(n log n) algorithm for the generalized birthday problem
• Pattern matching between two non-aligned random sequences
• Distribution of the minimum number of points in a scanning interval on the line
• Maximum scan score-type statistics
• Uneven allocation of elements in linear multi-state sliding window system
• Combined \(m\)-consecutive and \(k\)-out-of-\(n\) sliding window systems
• The number of dense arrangements
• Runs, scans and urn model distributions: A unified Markov chain approach
• An efficient algorithm for exact distribution of discrete scan statistics
• Discrete scan statistics generated by exchangeable binary trials
• Bonferroni-type inequalities for conditional scan statistics
• \(p\)-values for the discrete scan statistic through slack variables
• Scan statistic tail probability assessment based on process covariance and window size
• Multiple window discrete scan statistic for higher-order Markovian sequences
• Power of discrete scan statistics: a finite Markov chain imbedding approach
• Approximations for discrete scan statistics on the circle
• Measures for the exceptionality of gene order in conserved genomic regions
• Matching rectangles in d-dimensions: Algorithms and laws of large numbers
• Discrete, continuous and conditional multiple window scan statistics
• New recursive methods for scan statistic probabilities

This page was built for publication: Probabilities for a Generalized Birthday Problem

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