|
|
Publications in Math-Net.Ru |
Citations |
|
1983 |
1. |
I. P. Tsaregradskii, “Percolation through a finite layer”, TMF, 57:1 (1983), 105–114 ; Theoret. and Math. Phys., 57:1 (1983), 1020–1027 |
|
1982 |
2. |
I. P. Caregradskiĭ, “On a queueing system with an infinite number of locally interacting devices”, Teor. Veroyatnost. i Primenen., 27:3 (1982), 583–587 ; Theory Probab. Appl., 27:3 (1983), 624–628 |
1
|
3. |
V. A. Malyšev, I. P. Caregradskiĭ, “A queueing system with local interaction”, Teor. Veroyatnost. i Primenen., 27:3 (1982), 579–583 ; Theory Probab. Appl., 27:3 (1983), 619–624 |
5
|
|
1970 |
4. |
I. P. Tsaregradskii, “On a problem of search by networks”, Teor. Veroyatnost. i Primenen., 15:2 (1970), 326–330 ; Theory Probab. Appl., 15:2 (1970), 315–319 |
1
|
|
1958 |
5. |
I. P. Tsaregradskii, “A remark on the transmission capacity of a stationary channel with finite memory”, Uspekhi Mat. Nauk, 13:6(84) (1958), 49–61 |
6. |
I. P. Tsaregradskii, “On Uniform Approximation of the Binomial Distribution by Infinitely Divisible Laws”, Teor. Veroyatnost. i Primenen., 3:4 (1958), 470–474 ; Theory Probab. Appl., 3:4 (1958), 434–438 |
30
|
7. |
I. P. Tsaregradskii, “A Note on the Capacity of a Stationary Channel with Finite Memory”, Teor. Veroyatnost. i Primenen., 3:1 (1958), 84–96 ; Theory Probab. Appl., 3:1 (1958), 79–91 |
10
|
|
|
|