|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
I. Fazekas, A. N. Chuprunov, “Invariance principle for numbers of particles in cells of a general allocation scheme”, Diskr. Mat., 35:3 (2023), 81–99  |
|
2012 |
| 2. |
A. N. Chuprunov, I. Fazekas, “An analogue of the generalised allocation scheme: limit theorems for the maximum cell load”, Diskr. Mat., 24:3 (2012), 122–129   ; Discrete Math. Appl., 22:3 (2012), 307–314  |
8
|
| 3. |
A. N. Chuprunov, I. Fazekas, “On the generalised allocation scheme with a random number of particles”, Diskr. Mat., 24:2 (2012), 149–153 ; Discrete Math. Appl., 22:2 (2012), 235–240 |
1
|
| 4. |
A. N. Chuprunov, I. Fazekas, “An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles”, Diskr. Mat., 24:1 (2012), 140–158 ; Discrete Math. Appl., 22:1 (2012), 101–122 |
15
|
|
2011 |
| 5. |
A. N. Chuprunov, I. Fazekas, “Strong laws of large numbers for a number of error-free blocks under error-corrected coding”, Inform. Primen., 5:3 (2011), 80–85 |
| 6. |
I. Fazekas, “Merging to semistable processes”, Teor. Veroyatnost. i Primenen., 56:4 (2011), 726–741 ; Theory Probab. Appl., 56:4 (2011), 621–633  |
1
|
|
2010 |
| 7. |
A. N. Chuprunov, I. Fazekas, “Laws of iterated logarithm for numbers of nonerror blocks under error corrected coding”, Inform. Primen., 4:3 (2010), 42–46 |
1
|
|
2003 |
| 8. |
I. Fazekas, A. N. Chuprunov, “Almost sure limit theorems for the Pearson statistic”, Teor. Veroyatnost. i Primenen., 48:1 (2003), 162–169  ; Theory Probab. Appl., 48:1 (2004), 140–147 |
5
|
|
2000 |
| 9. |
I. Fazekas, O. Klesov, “A general approach to the strong laws of large numbers”, Teor. Veroyatnost. i Primenen., 45:3 (2000), 568–583 ; Theory Probab. Appl., 45:3 (2001), 436–449 |
64
|
|
| Organisations |
|
| |
|
|
Contact us: