Sequential Searches: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials Revisited
From MaRDI portal
Publication:4408855
DOI10.2307/2695614zbMath1034.68511OpenAlexW1978318590MaRDI QIDQ4408855
Publication date: 2001
Full work available at URL: https://doi.org/10.2307/2695614
Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) (q)-calculus and related topics (05A30)
Related Items (3)
The Multivariate Probabilistic Josephus Problem ⋮ Statistical Certification of Software Systems ⋮ On the Reliability of an n-Component System
This page was built for publication: Sequential Searches: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials Revisited