RUS  ENG
Full version
PEOPLE

Tsybakov Boris Solomonovich

Publications in Math-Net.Ru

  1. On Walsh code assignment

    Probl. Peredachi Inf., 48:4 (2012),  41–49
  2. On a model and capacity of MIMO channels

    Probl. Peredachi Inf., 47:2 (2011),  7–16
  3. A Different Approach to Finding the Capacity of a Gaussian Vector Channel

    Probl. Peredachi Inf., 42:3 (2006),  21–36
  4. Busy Periods in Systems with Heterogeneous Servers or Channels

    Probl. Peredachi Inf., 41:3 (2005),  105–122
  5. Some Constructions of Conflict-Avoiding Codes

    Probl. Peredachi Inf., 38:4 (2002),  24–36
  6. The Best and Worst Packet Transmission Policies

    Probl. Peredachi Inf., 32:4 (1996),  72–92
  7. Channel Assignment in Cellular Networks

    Probl. Peredachi Inf., 32:1 (1996),  91–99
  8. Packet Delay Caused by Stack-Algorithm for Overcritical Income Flow

    Probl. Peredachi Inf., 30:4 (1994),  76–89
  9. Average Packet Output Time For Conflict with Multiplicity 3 and Ternary Feedback

    Probl. Peredachi Inf., 30:4 (1994),  59–75
  10. Packet Output Time for a Strategy Which Knows the Multiplicities of Occurring Conflicts

    Probl. Peredachi Inf., 30:2 (1994),  61–75
  11. Packet Delay in a DQDB Network

    Probl. Peredachi Inf., 29:4 (1993),  67–93
  12. On a Random Process in the Multiple Access Problems

    Probl. Peredachi Inf., 29:2 (1993),  72–84
  13. Random Access Algorithms with Multiple Reception Capability and $n$-ary Feedback Channel

    Probl. Peredachi Inf., 29:1 (1993),  82–91
  14. Lower Bound on Delay in an RMA System with $N$-Conflicts and Errors

    Probl. Peredachi Inf., 28:4 (1992),  69–85
  15. Multiple Access with Collision Resolution by Station Indices

    Probl. Peredachi Inf., 28:3 (1992),  27–39
  16. The Throughput of the Stack Algorithm in a Channel with $N$-Conflicts

    Probl. Peredachi Inf., 28:2 (1992),  78–85
  17. An Access Algorithm for a Communication Channel

    Probl. Peredachi Inf., 28:1 (1992),  97–111
  18. Blocked RMA Stack Algorithm for a Network with a Finite Number of Stations

    Probl. Peredachi Inf., 28:1 (1992),  89–96
  19. Lower Bound on Delay in a Random Multiple Access System

    Probl. Peredachi Inf., 27:3 (1991),  73–88
  20. Stack Algorithm in a Broadcast Channel with Capture

    Probl. Peredachi Inf., 27:2 (1991),  25–34
  21. Random Multiple Access in Binary Feedback Channel

    Probl. Peredachi Inf., 26:4 (1990),  83–98
  22. Random Multiple Access in a Channel with Binary “Success – No Success” Feedback

    Probl. Peredachi Inf., 26:3 (1990),  67–82
  23. A Simple Stable RMA Algorithm for LAN

    Probl. Peredachi Inf., 26:2 (1990),  75–86
  24. Random Multiple Access with Known Appearance Times of Successfully Transmitted Packets

    Probl. Peredachi Inf., 26:2 (1990),  62–74
  25. Comparison of Some Multiple-Access Systems

    Probl. Peredachi Inf., 26:1 (1990),  68–75
  26. Upper Bound on the Capacity of a Packet Random Multiple Access System with Errors

    Probl. Peredachi Inf., 25:4 (1989),  50–62
  27. Stack Algorithm in a Local Area Network with Errors in the Channel

    Probl. Peredachi Inf., 25:3 (1989),  76–89
  28. A Nonhomogeneous Frame RMA Algorithm

    Probl. Peredachi Inf., 25:2 (1989),  54–66
  29. Randomized and Nonrandomized Algorithms of Random Multiple Access

    Probl. Peredachi Inf., 25:1 (1989),  88–99
  30. Computing Packet Delay for Some Random Multiple Access Stack Algorithms

    Probl. Peredachi Inf., 24:3 (1988),  94–101
  31. 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
  32. Performance of a RMA Stack Algorithm in a Local Network

    Probl. Peredachi Inf., 23:4 (1987),  87–101
  33. Upper Bound on the Capacity of a Random Multiple-Access System

    Probl. Peredachi Inf., 23:3 (1987),  64–78
  34. A Multiaccess Stack Algorithm for an Asynchronous System

    Probl. Peredachi Inf., 23:1 (1987),  97–105
  35. Packet Transmission Using a Blocked Unmodified RMA Stack-Algorithm

    Probl. Peredachi Inf., 22:3 (1986),  96–102
  36. Local-Area Network with Random-Multiple-Access Stack Algorithm

    Probl. Peredachi Inf., 22:2 (1986),  49–58
  37. Some New Random Multiple-Access Algorithms

    Probl. Peredachi Inf., 21:2 (1985),  69–89
  38. Packet Transmission in Radio Networks

    Probl. Peredachi Inf., 21:1 (1985),  80–101
  39. Random Multiple Access System with Impatient Packets

    Probl. Peredachi Inf., 20:4 (1984),  64–85
  40. Packet Delay in the Case of a Multiple-Access Stack Algorithm

    Probl. Peredachi Inf., 20:2 (1984),  77–97
  41. Stability of Asynchronous ALOHA System

    Probl. Peredachi Inf., 20:1 (1984),  82–94
  42. Random Multiple Access of “Impatient” Packets to a Broadcast Channel

    Probl. Peredachi Inf., 19:4 (1983),  72–83
  43. Packet Switching in a Channel without Feedback

    Probl. Peredachi Inf., 19:2 (1983),  69–84
  44. Random Multiple Access of Packets to a Channel with Errors

    Probl. Peredachi Inf., 19:2 (1983),  52–68
  45. Bounds for Packet Transmission Rate in a Random-Multiple-Access System

    Probl. Peredachi Inf., 19:1 (1983),  61–81
  46. Upper Bound for the Delay in a Multiple-Random-Access System with a Splitting Algorithm

    Probl. Peredachi Inf., 18:4 (1982),  76–84
  47. Allowance for Packet Propagation Delay in Random Multiple Access Systems

    Probl. Peredachi Inf., 17:2 (1981),  75–78
  48. Upper Bound for the Capacity of a Random Multiple Access System

    Probl. Peredachi Inf., 17:1 (1981),  90–95
  49. Random Multiple Packet Access: Part-and-Try Algorithm

    Probl. Peredachi Inf., 16:4 (1980),  65–79
  50. Random Multiple-Access Stack Algorithm

    Probl. Peredachi Inf., 16:3 (1980),  80–94
  51. Resolution of a Conflict of Known Multiplicity

    Probl. Peredachi Inf., 16:2 (1980),  69–82
  52. Multiple Access with Reservation

    Probl. Peredachi Inf., 16:1 (1980),  50–76
  53. Ergodicity of a Slotted ALOHA System

    Probl. Peredachi Inf., 15:4 (1979),  73–87
  54. Free Synchronous Packet Access in a Broadcast Channel with Feedback

    Probl. Peredachi Inf., 14:4 (1978),  32–59
  55. Lower Bound for Rate of Optimum Error- and Defect-Correcting Code

    Probl. Peredachi Inf., 14:2 (1978),  11–27
  56. Bounds for the Codes Correcting Errors and Defects

    Probl. Peredachi Inf., 13:2 (1977),  11–22
  57. Defect and Error Correction

    Probl. Peredachi Inf., 11:3 (1975),  21–30
  58. Additive Group Codes for Defect Correction

    Probl. Peredachi Inf., 11:1 (1975),  111–113
  59. Coding in a Memory with Defective Cells

    Probl. Peredachi Inf., 10:2 (1974),  52–60
  60. Blocking Probability for a Rearrangeable Switching System

    Probl. Peredachi Inf., 6:4 (1970),  66–80
  61. Capacity of a Discrete-Time Gaussian Channel with a Filter

    Probl. Peredachi Inf., 6:3 (1970),  78–82
  62. The Epsilon-Entropy of a Vector Message

    Probl. Peredachi Inf., 5:1 (1969),  96–97
  63. Sequential Decoding in a Continuous Channel

    Probl. Peredachi Inf., 3:4 (1967),  5–17
  64. Asynchronous Channels with Synchrosymbols

    Probl. Peredachi Inf., 2:1 (1966),  28–36
  65. Capacity of vector Gaussian memoryless channel

    Probl. Peredachi Inf., 1:1 (1965),  26–40

  66. Mark Semenovich Pinsker. In Memoriam

    Probl. Peredachi Inf., 40:1 (2004),  3–5

© Steklov Math. Inst. of RAS, 2026