On waiting time in the scheme of random allocation of coloured particies
From MaRDI portal
Publication:4857748
Recommendations
Cited in
(7)- On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
- Pairing inversion for finding discrete logarithms
- A non-uniform birthday problem with applications to discrete logarithms
- Computing discrete logarithms in an interval
- On comparison of clustering properties of point processes
- The number of collisions for the occupancy problem with unequal probabilities
This page was built for publication: On waiting time in the scheme of random allocation of coloured particies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857748)