|
|
|
Publications in Math-Net.Ru |
Citations |
|
1989 |
| 1. |
I. B. Kalugin, “The number of components in a random bipartite graph”, Diskr. Mat., 1:3 (1989), 62–70    ; Discrete Math. Appl., 1:3 (1991), 289–299 |
|
1986 |
| 2. |
I. B. Kalugin, “Characterization of random mappings”, Mat. Zametki, 39:3 (1986), 424–430 ; Math. Notes, 39:3 (1986), 233–237  |
| 3. |
I. B. Kalugin, “A class of random mappings”, Trudy Mat. Inst. Steklov., 177 (1986), 75–104 ; Proc. Steklov Inst. Math., 177 (1988), 79–110 |
1
|
|
1983 |
| 4. |
I. B. Kalugin, “Branching processes and random mappings of finite sets”, Mat. Zametki, 34:5 (1983), 757–771 ; Math. Notes, 34:5 (1983), 870–879 |
|
Contact us: