|
|
Publications in Math-Net.Ru |
Citations |
|
1993 |
1. |
N. B. Likhanov, I. Plotnik, Y. Shavitt, M. Sidi, B. S. Tsybakov, “Random Access Algorithms with Multiple Reception Capability and $n$-ary Feedback Channel”, Probl. Peredachi Inf., 29:1 (1993), 82–91 ; Problems Inform. Transmission, 29:1 (1993), 70–79 |
|
1991 |
2. |
B. S. Tsybakov, N. B. Likhanov, “Lower Bound on Delay in a Random Multiple Access System”, Probl. Peredachi Inf., 27:3 (1991), 73–88 ; Problems Inform. Transmission, 27:3 (1991), 247–260 |
1
|
|
1990 |
3. |
B. S. Tsybakov, N. B. Likhanov, “Random Multiple Access with Known Appearance Times of Successfully Transmitted Packets”, Probl. Peredachi Inf., 26:2 (1990), 62–74 ; Problems Inform. Transmission, 26:2 (1990), 141–151 |
|
1989 |
4. |
B. S. Tsybakov, N. B. Likhanov, “Upper Bound on the Capacity of a Packet Random Multiple Access System with Errors”, Probl. Peredachi Inf., 25:4 (1989), 50–62 ; Problems Inform. Transmission, 25:4 (1989), 297–308 |
|
1987 |
5. |
B. S. Tsybakov, N. B. Likhanov, “Upper Bound on the Capacity of a Random Multiple-Access System”, Probl. Peredachi Inf., 23:3 (1987), 64–78 ; Problems Inform. Transmission, 23:3 (1987), 224–236 |
1
|
|
1985 |
6. |
B. S. Tsybakov, N. B. Likhanov, “Some New Random Multiple-Access Algorithms”, Probl. Peredachi Inf., 21:2 (1985), 69–89 ; Problems Inform. Transmission, 21:2 (1985), 134–153 |
|
1984 |
7. |
B. S. Tsybakov, N. B. Likhanov, “Random Multiple Access System with Impatient Packets”, Probl. Peredachi Inf., 20:4 (1984), 64–85 ; Problems Inform. Transmission, 20:4 (1984), 284–303 |
|
1983 |
8. |
B. S. Tsybakov, N. B. Likhanov, “Packet Switching in a Channel without Feedback”, Probl. Peredachi Inf., 19:2 (1983), 69–84 ; Problems Inform. Transmission, 19:2 (1983), 147–161 |
6
|
9. |
B. S. Tsybakov, V. A. Mikhailov, N. B. Likhanov, “Bounds for Packet Transmission Rate in a Random-Multiple-Access System”, Probl. Peredachi Inf., 19:1 (1983), 61–81 ; Problems Inform. Transmission, 19:1 (1983), 50–68 |
|
1982 |
10. |
B. S. Tsybakov, N. B. Likhanov, “Upper Bound for the Delay in a Multiple-Random-Access System with a Splitting Algorithm”, Probl. Peredachi Inf., 18:4 (1982), 76–84 ; Problems Inform. Transmission, 18:4 (1982), 279–285 |
|
|
|