Probabilities for a Generalized Birthday Problem
From MaRDI portal
Publication:4043840
DOI10.2307/2286023zbMath0292.60032OpenAlexW4239682326MaRDI QIDQ4043840
Publication date: 1974
Full work available at URL: https://doi.org/10.2307/2286023
Related Items (21)
Pattern matching between two non-aligned random sequences ⋮ Scan statistic tail probability assessment based on process covariance and window size ⋮ Runs, scans and urn model distributions: A unified Markov chain approach ⋮ An O(n log n) algorithm for the generalized birthday problem ⋮ The number of dense arrangements ⋮ An efficient algorithm for exact distribution of discrete scan statistics ⋮ Combined \(m\)-consecutive and \(k\)-out-of-\(n\) sliding window systems ⋮ Multiple window discrete scan statistic for higher-order Markovian sequences ⋮ Approximations for discrete scan statistics on the circle ⋮ Power of discrete scan statistics: a finite Markov chain imbedding approach ⋮ New recursive methods for scan statistic probabilities ⋮ Discrete, Continuous and Conditional Multiple Window Scan Statistics ⋮ Uneven allocation of elements in linear multi-state sliding window system ⋮ Maximum scan score-type statistics ⋮ Sequential Window Problems ⋮ Bonferroni-type inequalities for conditional scan statistics ⋮ Measures for the exceptionality of gene order in conserved genomic regions ⋮ Distribution of the minimum number of points in a scanning interval on the line ⋮ Discrete Scan Statistics Generated by Exchangeable Binary Trials ⋮ p-values for the Discrete Scan Statistic through Slack Variables ⋮ Matching rectangles in d-dimensions: Algorithms and laws of large numbers
This page was built for publication: Probabilities for a Generalized Birthday Problem
