20 citations to https://www.mathnet.ru/rus/tvp3274
  1. Ljuben Mutafchiev, Steven Finch, “On the deepest cycle of a random mapping”, Journal of Combinatorial Theory, Series A, 206 (2024), 105875  crossref
  2. Danila Demin, Maksim Zhukovskii, Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024, 1  crossref
  3. Simon Tavaré, “A note on the Screaming Toes game”, J. Appl. Probab., 59:1 (2022), 118  crossref
  4. Andrew MacFie, Daniel Panario, Lecture Notes in Computer Science, 7533, Progress in Cryptology – LATINCRYPT 2012, 2012, 254  crossref
  5. А. Н. Тимашёв, “Случайные отображения конечных множеств с известным числом компонент”, Теория вероятн. и ее примен., 48:4 (2003), 818–828  mathnet  crossref  mathscinet  zmath; A. N. Timashev, “Random mappings of finite sets with a known number of components”, Theory Probab. Appl., 48:4 (2004), 741–751  crossref  isi
  6. Richard Arratia, A. D. Barbour, Simon Tavaré, “The number of components in a logarithmic combinatorial structure”, Ann. Appl. Probab., 10:2 (2000)  crossref
  7. Richard Arratia, Simon Tavaré, “Limit Theorems for Combinatorial Structures via Discrete Process Approximations”, Random Struct Algorithms, 3:3 (1992), 321  crossref
  8. P. J. Donnelly, W. J. Ewens, S. Padmadisastra, “Functionals of random mappings: exact and asymptotic results”, Advances in Applied Probability, 23:3 (1991), 437  crossref
  9. P. J. Donnelly, W. J. Ewens, S. Padmadisastra, “Functionals of random mappings: exact and asymptotic results”, Adv. Appl. Probab., 23:03 (1991), 437  crossref
  10. Joseph Kupka, “The distribution and moments of the number of components of a random function”, J. Appl. Probab., 27:01 (1990), 202  crossref
1
2
Следующая