On waiting time in the scheme of random allocation of coloured particies
From MaRDI portal
Publication:4857748
DOI10.1515/dma.1995.5.1.73zbMath0840.60015OpenAlexW2065533565MaRDI QIDQ4857748
Publication date: 15 January 1996
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.1995.5.1.73
Related Items (7)
A non-uniform birthday problem with applications to discrete logarithms ⋮ Computing discrete logarithms in an interval ⋮ On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme ⋮ On Comparison of Clustering Properties of Point Processes ⋮ The Number of Collisions for the Occupancy Problem with Unequal Probabilities ⋮ Pairing inversion for finding discrete logarithms ⋮ Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
This page was built for publication: On waiting time in the scheme of random allocation of coloured particies
