|
|
Publications in Math-Net.Ru |
Citations |
|
2012 |
1. |
B. S. Tsybakov, A. B. Tsybakov, “On Walsh code assignment”, Probl. Peredachi Inf., 48:4 (2012), 41–49 ; Problems Inform. Transmission, 48:4 (2012), 334–341 |
1
|
|
2011 |
2. |
B. S. Tsybakov, “On a model and capacity of MIMO channels”, Probl. Peredachi Inf., 47:2 (2011), 7–16 ; Problems Inform. Transmission, 47:2 (2011), 89–97 |
|
2006 |
3. |
B. S. Tsybakov, “A Different Approach to Finding the Capacity of a Gaussian Vector Channel”, Probl. Peredachi Inf., 42:3 (2006), 21–36 ; Problems Inform. Transmission, 42:3 (2006), 183–196 |
3
|
|
2005 |
4. |
B. S. Tsybakov, “Busy Periods in Systems with Heterogeneous Servers or Channels”, Probl. Peredachi Inf., 41:3 (2005), 105–122 ; Problems Inform. Transmission, 41:3 (2005), 280–295 |
3
|
|
2002 |
5. |
B. S. Tsybakov, A. R. Rubinov, “Some Constructions of Conflict-Avoiding Codes”, Probl. Peredachi Inf., 38:4 (2002), 24–36 ; Problems Inform. Transmission, 38:4 (2002), 268–279 |
22
|
|
1996 |
6. |
B. S. Tsybakov, P. Papantoni-Kazakos, “The Best and Worst Packet Transmission Policies”, Probl. Peredachi Inf., 32:4 (1996), 72–92 ; Problems Inform. Transmission, 32:4 (1996), 365–382 |
1
|
7. |
S. P. Fedortsev, B. S. Tsybakov, “Channel Assignment in Cellular Networks”, Probl. Peredachi Inf., 32:1 (1996), 91–99 ; Problems Inform. Transmission, 32:1 (1996), 78–85 |
1
|
|
1994 |
8. |
N. D. Vvedenskaya, Ph. Jacquet, B. S. Tsybakov, “Packet Delay Caused by Stack-Algorithm for Overcritical Income Flow”, Probl. Peredachi Inf., 30:4 (1994), 76–89 ; Problems Inform. Transmission, 30:4 (1994), 357–369 |
9. |
B. S. Tsybakov, “Average Packet Output Time For Conflict with Multiplicity 3 and Ternary Feedback”, Probl. Peredachi Inf., 30:4 (1994), 59–75 ; Problems Inform. Transmission, 30:4 (1994), 341–356 |
10. |
B. S. Tsybakov, “Packet Output Time for a Strategy Which Knows the Multiplicities of Occurring Conflicts”, Probl. Peredachi Inf., 30:2 (1994), 61–75 ; Problems Inform. Transmission, 30:2 (1994), 145–157 |
|
1993 |
11. |
B. S. Tsybakov, A. Yu. Privalov, “Packet Delay in a DQDB Network”, Probl. Peredachi Inf., 29:4 (1993), 67–93 ; Problems Inform. Transmission, 29:4 (1993), 358–380 |
12. |
B. S. Tsybakov, “On a Random Process in the Multiple Access Problems”, Probl. Peredachi Inf., 29:2 (1993), 72–84 ; Problems Inform. Transmission, 29:2 (1993), 163–175 |
13. |
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 |
|
1992 |
14. |
B. S. Tsybakov, A. Yu. Privalov, “Lower Bound on Delay in an RMA System with $N$-Conflicts and Errors”, Probl. Peredachi Inf., 28:4 (1992), 69–85 ; Problems Inform. Transmission, 28:4 (1992), 360–374 |
15. |
B. S. Tsybakov, S. P. Fedortsev, N. A. Ryleeva, “Multiple Access with Collision Resolution by Station Indices”, Probl. Peredachi Inf., 28:3 (1992), 27–39 ; Problems Inform. Transmission, 28:3 (1992), 221–231 |
1
|
16. |
B. S. Tsybakov, A. Yu. Privalov, “The Throughput of the Stack Algorithm in a Channel with $N$-Conflicts”, Probl. Peredachi Inf., 28:2 (1992), 78–85 ; Problems Inform. Transmission, 28:2 (1992), 168–174 |
17. |
B. S. Tsybakov, S. P. Fedortsev, “An Access Algorithm for a Communication Channel”, Probl. Peredachi Inf., 28:1 (1992), 97–111 ; Problems Inform. Transmission, 28:1 (1992), 86–99 |
18. |
B. S. Tsybakov, V. B. Faingol'd, “Blocked RMA Stack Algorithm for a Network with a Finite Number of Stations”, Probl. Peredachi Inf., 28:1 (1992), 89–96 ; Problems Inform. Transmission, 28:1 (1992), 79–86 |
|
1991 |
19. |
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
|
20. |
N. D. Vvedenskaya, B. S. Tsybakov, “Stack Algorithm in a Broadcast Channel with Capture”, Probl. Peredachi Inf., 27:2 (1991), 25–34 ; Problems Inform. Transmission, 27:2 (1991), 107–116 |
|
1990 |
21. |
B. S. Tsybakov, A. N. Beloyarov, “Random Multiple Access in Binary Feedback Channel”, Probl. Peredachi Inf., 26:4 (1990), 83–98 ; Problems Inform. Transmission, 26:4 (1990), 354–366 |
5
|
22. |
B. S. Tsybakov, A. N. Beloyarov, “Random Multiple Access in a Channel with Binary “Success – No Success” Feedback”, Probl. Peredachi Inf., 26:3 (1990), 67–82 ; Problems Inform. Transmission, 26:3 (1990), 245–260 |
5
|
23. |
B. S. Tsybakov, V. B. Faingol'd, S. P. Fedortsev, “A Simple Stable RMA Algorithm for LAN”, Probl. Peredachi Inf., 26:2 (1990), 75–86 ; Problems Inform. Transmission, 26:2 (1990), 151–160 |
24. |
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 |
25. |
B. S. Tsybakov, “Comparison of Some Multiple-Access Systems”, Probl. Peredachi Inf., 26:1 (1990), 68–75 ; Problems Inform. Transmission, 26:1 (1990), 57–62 |
|
1989 |
26. |
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 |
27. |
B. S. Tsybakov, S. P. Fedortsev, “Stack Algorithm in a Local Area Network with Errors in the Channel”, Probl. Peredachi Inf., 25:3 (1989), 76–89 ; Problems Inform. Transmission, 25:3 (1989), 229–240 |
28. |
B. S. Tsybakov, V. B. Faingol'd, “A Nonhomogeneous Frame RMA Algorithm”, Probl. Peredachi Inf., 25:2 (1989), 54–66 ; Problems Inform. Transmission, 25:2 (1989), 126–136 |
29. |
B. S. Tsybakov, “Randomized and Nonrandomized Algorithms of Random Multiple Access”, Probl. Peredachi Inf., 25:1 (1989), 88–99 ; Problems Inform. Transmission, 25:1 (1989), 67–76 |
|
1988 |
30. |
N. D. Vvedenskaya, B. S. Tsybakov, “Computing Packet Delay for Some Random Multiple Access Stack Algorithms”, Probl. Peredachi Inf., 24:3 (1988), 94–101 ; Problems Inform. Transmission, 24:3 (1988), 246–253 |
1
|
31. |
B. S. Tsybakov, V. L. Bakirov, “Stability Analysis of a Packet Switching Network and Its Application to the Construction of a Unified Approach to Synchronous and Asynchronous ALOHA Radio Networks”, Probl. Peredachi Inf., 24:2 (1988), 70–85 ; Problems Inform. Transmission, 24:2 (1988), 139–151 |
1
|
|
1987 |
32. |
B. S. Tsybakov, S. P. Fedortsev, “Performance of a RMA Stack Algorithm in a Local Network”, Probl. Peredachi Inf., 23:4 (1987), 87–101 ; Problems Inform. Transmission, 23:4 (1987), 323–326 |
33. |
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
|
34. |
B. S. Tsybakov, V. L. Bakirov, A. V. Zhukov, I. D. Kalashnikov, A. I. Martynov, S. E. Sokolov, “A Multiaccess Stack Algorithm for an Asynchronous System”, Probl. Peredachi Inf., 23:1 (1987), 97–105 ; Problems Inform. Transmission, 23:1 (1987), 81–89 |
|
1986 |
35. |
B. S. Tsybakov, S. P. Fedortsev, “Packet Transmission Using a Blocked Unmodified RMA Stack-Algorithm”, Probl. Peredachi Inf., 22:3 (1986), 96–102 ; Problems Inform. Transmission, 22:3 (1986), 239–245 |
36. |
B. S. Tsybakov, S. P. Fedortsev, “Local-Area Network with Random-Multiple-Access Stack Algorithm”, Probl. Peredachi Inf., 22:2 (1986), 49–58 ; Problems Inform. Transmission, 22:2 (1986), 117–125 |
|
1985 |
37. |
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 |
38. |
B. S. Tsybakov, V. L. Bakirov, “Packet Transmission in Radio Networks”, Probl. Peredachi Inf., 21:1 (1985), 80–101 ; Problems Inform. Transmission, 21:1 (1985), 60–76 |
|
1984 |
39. |
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 |
40. |
N. D. Vvedenskaya, B. S. Tsybakov, “Packet Delay in the Case of a Multiple-Access Stack Algorithm”, Probl. Peredachi Inf., 20:2 (1984), 77–97 ; Problems Inform. Transmission, 20:2 (1984), 137–153 |
41. |
B. S. Tsybakov, V. L. Bakirov, “Stability of Asynchronous ALOHA System”, Probl. Peredachi Inf., 20:1 (1984), 82–94 ; Problems Inform. Transmission, 20:1 (1984), 63–72 |
|
1983 |
42. |
B. S. Tsybakov, N. D. Vvedenskaya, “Random Multiple Access of “Impatient” Packets to a Broadcast Channel”, Probl. Peredachi Inf., 19:4 (1983), 72–83 ; Problems Inform. Transmission, 19:4 (1983), 305–313 |
43. |
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
|
44. |
N. D. Vvedenskaya, B. S. Tsybakov, “Random Multiple Access of Packets to a Channel with Errors”, Probl. Peredachi Inf., 19:2 (1983), 52–68 ; Problems Inform. Transmission, 19:2 (1983), 131–146 |
45. |
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 |
46. |
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 |
|
1981 |
47. |
B. S. Tsybakov, V. A. Mikhailov, S. P. Fedortsev, “Allowance for Packet Propagation Delay in Random Multiple Access Systems”, Probl. Peredachi Inf., 17:2 (1981), 75–78 ; Problems Inform. Transmission, 17:2 (1981), 131–134 |
48. |
V. A. Mikhailov, B. S. Tsybakov, “Upper Bound for the Capacity of a Random Multiple Access System”, Probl. Peredachi Inf., 17:1 (1981), 90–95 ; Problems Inform. Transmission, 17:1 (1981), 63–67 |
1
|
|
1980 |
49. |
B. S. Tsybakov, V. A. Mikhailov, “Random Multiple Packet Access: Part-and-Try Algorithm”, Probl. Peredachi Inf., 16:4 (1980), 65–79 ; Problems Inform. Transmission, 16:4 (1980), 305–317 |
6
|
50. |
B. S. Tsybakov, N. D. Vvedenskaya, “Random Multiple-Access Stack Algorithm”, Probl. Peredachi Inf., 16:3 (1980), 80–94 ; Problems Inform. Transmission, 16:3 (1980), 230–243 |
51. |
B. S. Tsybakov, “Resolution of a Conflict of Known Multiplicity”, Probl. Peredachi Inf., 16:2 (1980), 69–82 ; Problems Inform. Transmission, 16:2 (1980), 134–144 |
52. |
B. S. Tsybakov, M. A. Berkovskii, “Multiple Access with Reservation”, Probl. Peredachi Inf., 16:1 (1980), 50–76 ; Problems Inform. Transmission, 16:1 (1980), 35–54 |
|
1979 |
53. |
B. S. Tsybakov, V. A. Mikhailov, “Ergodicity of a Slotted ALOHA System”, Probl. Peredachi Inf., 15:4 (1979), 73–87 ; Problems Inform. Transmission, 15:4 (1979), 301–312 |
1
|
|
1978 |
54. |
B. S. Tsybakov, V. A. Mikhailov, “Free Synchronous Packet Access in a Broadcast Channel with Feedback”, Probl. Peredachi Inf., 14:4 (1978), 32–59 ; Problems Inform. Transmission, 14:4 (1978), 259–280 |
15
|
55. |
B. S. Tsybakov, “Lower Bound for Rate of Optimum Error- and Defect-Correcting Code”, Probl. Peredachi Inf., 14:2 (1978), 11–27 ; Problems Inform. Transmission, 14:2 (1978), 85–96 |
|
1977 |
56. |
B. S. Tsybakov, “Bounds for the Codes Correcting Errors and Defects”, Probl. Peredachi Inf., 13:2 (1977), 11–22 ; Problems Inform. Transmission, 13:2 (1977), 89–97 |
|
1975 |
57. |
B. S. Tsybakov, “Defect and Error Correction”, Probl. Peredachi Inf., 11:3 (1975), 21–30 ; Problems Inform. Transmission, 11:3 (1975), 195–202 |
58. |
B. S. Tsybakov, “Additive Group Codes for Defect Correction”, Probl. Peredachi Inf., 11:1 (1975), 111–113 ; Problems Inform. Transmission, 11:1 (1975), 88–90 |
|
1974 |
59. |
A. V. Kuznetsov, B. S. Tsybakov, “Coding in a Memory with Defective Cells”, Probl. Peredachi Inf., 10:2 (1974), 52–60 ; Problems Inform. Transmission, 10:2 (1974), 132–138 |
3
|
|
1970 |
60. |
L. A. Bassalygo, B. S. Tsybakov, “Blocking Probability for a Rearrangeable Switching System”, Probl. Peredachi Inf., 6:4 (1970), 66–80 ; Problems Inform. Transmission, 6:4 (1970), 336–348 |
61. |
B. S. Tsybakov, “Capacity of a Discrete-Time Gaussian Channel with a Filter”, Probl. Peredachi Inf., 6:3 (1970), 78–82 ; Problems Inform. Transmission, 6:3 (1970), 253–256 |
1
|
|
1969 |
62. |
B. S. Tsybakov, “The Epsilon-Entropy of a Vector Message”, Probl. Peredachi Inf., 5:1 (1969), 96–97 ; Problems Inform. Transmission, 5:1 (1969), 78–79 |
1
|
|
1967 |
63. |
K. Sh. Zigangirov, M. S. Pinsker, B. S. Tsybakov, “Sequential Decoding in a Continuous Channel”, Probl. Peredachi Inf., 3:4 (1967), 5–17 ; Problems Inform. Transmission, 3:4 (1967), 1–10 |
|
1966 |
64. |
B. S. Tsybakov, “Asynchronous Channels with Synchrosymbols”, Probl. Peredachi Inf., 2:1 (1966), 28–36 ; Problems Inform. Transmission, 2:1 (1966), 22–28 |
|
1965 |
65. |
B. S. Tsybakov, “Capacity of vector Gaussian memoryless channel”, Probl. Peredachi Inf., 1:1 (1965), 26–40 |
1
|
|
|
|
2004 |
66. |
A. M. Barg, L. A. Bassalygo, V. M. Blinovskii, M. V. Burnashev, N. D. Vvedenskaya, G. K. Golubev, I. I. Dumer, K. Sh. Zigangirov, V. V. Zyablov, V. A. Zinov'ev, G. A. Kabatiansky, V. D. Kolesnik, N. A. Kuznetsov, V. A. Malyshev, R. A. Minlos, D. Yu. Nogin, I. A. Ovseevich, V. V. Prelov, Yu. L. Sagalovich, V. M. Tikhomirov, R. Z. Khas'minskii, B. S. Tsybakov, “Mark Semenovich Pinsker. In Memoriam”, Probl. Peredachi Inf., 40:1 (2004), 3–5 ; Problems Inform. Transmission, 40:1 (2004), 1–4 |
2
|
|
Organisations |
|
|
|
|