Communication Network Theory
| Issue | Title | File | |
| Vol 55, No 2 (2019) | The Geometry of Big Queues |
 (Eng) |
|
| Puhalskii A.A. | |||
| Vol 55, No 1 (2019) | Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound |
(Eng) |
|
| Fong S.L., Tan V.Y. | |||
| Vol 54, No 3 (2018) | Propagation of Chaos and Poisson Hypothesis |
(Eng) |
|
| Vladimirov A.A., Pirogov S.A., Rybko A.N., Shlosman S.B. | |||
| Vol 54, No 2 (2018) | Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems |
(Eng) |
|
| Ryabko B.Y. | |||
| Vol 54, No 2 (2018) | Maximum Remaining Service Time in Infinite-Server Queues |
(Eng) |
|
| Lebedev A.V. | |||
| Vol 53, No 2 (2017) | Fast protocols for leader election and spanning tree construction in a distributed network |
(Eng) |
|
| Vyalyi M.N., Khuziev I.M. | |||
| Vol 52, No 2 (2016) | Doubly randomized protocols for a random multiple access channel with “success–nonsuccess” feedback |
(Eng) |
|
| Foss S.G., Hajek B., Turlikov A.M. | |||
| Vol 52, No 1 (2016) | Lattice flows in networks |
(Eng) |
|
| Shmatkov V.D. | |||
| 1 - 8 of 8 Items | |||