This publication is cited in the following articles:
D. V. Pilschikov, “Ob odnom teoretiko-veroyatnostnom podkhode k obosnovaniyu nadezhnosti metoda Khellmana”, Matem. vopr. kriptogr., 10:1 (2019), 83–114
V. O. Mironkin, “Collisions and incidence of vertices and components in the graph of $k$-fold iteration of the uniform random mapping”, Discrete Math. Appl., 31:4 (2021), 259–269
V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 10:3 (2019), 89–99
A. M. Zubkov, A. A. Serov, “Estimates of the mean size of the subset image under composition of random mappings”, Discrete Math. Appl., 28:5 (2018), 331–338
V. O. Mironkin, V. G. Mikhailov, “O mnozhestve obrazov $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matem. vopr. kriptogr., 9:3 (2018), 99–108
V. O. Mironkin, “Ob otsenkakh raspredeleniya dliny otrezka aperiodichnosti v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, PDM, 2018, no. 42, 6–17
V. A. Vatutin, “Uslovnaya predelnaya teorema dlya blizkikh k kriticheskim vetvyaschikhsya protsessov s finalnym tipom chastits”, Matem. vopr. kriptogr., 9:4 (2018), 53–72
A. M. Zubkov, A. A. Serov, “Limit theorem for the size of an image of subset under compositions of random mappings”, Discrete Math. Appl., 28:2 (2018), 131–138
A. M. Zubkov, V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe $k$-kratnoi iteratsii sluchainogo ravnoveroyatnogo otobrazheniya”, Matem. vopr. kriptogr., 8:4 (2017), 63–74
D. V. Pilshchikov, “On the limiting mean values in probabilistic models of time-memory-data tradeoff methods”, Matem. vopr. kriptogr., 6:2 (2015), 59–65
D. V. Pilschikov, “Analiz slozhnosti algoritma parallelnogo poiska “zolotoi” kollizii”, Matem. vopr. kriptogr., 6:4 (2015), 77–97
A. M. Zubkov, A. A. Serov, “Images of subset of finite set under iterations of random mappings”, Discrete Math. Appl., 25:3 (2015), 179–185
