Likhanov N B

Publications in Math-Net.Ru

1. Random Access Algorithms with Multiple Reception Capability and $n$-ary Feedback Channel
   
   Probl. Peredachi Inf., 29:1 (1993),  82–91
2. Lower Bound on Delay in a Random Multiple Access System
   
   Probl. Peredachi Inf., 27:3 (1991),  73–88
3. Random Multiple Access with Known Appearance Times of Successfully Transmitted Packets
   
   Probl. Peredachi Inf., 26:2 (1990),  62–74
4. Upper Bound on the Capacity of a Packet Random Multiple Access System with Errors
   
   Probl. Peredachi Inf., 25:4 (1989),  50–62
5. Upper Bound on the Capacity of a Random Multiple-Access System
   
   Probl. Peredachi Inf., 23:3 (1987),  64–78
6. Some New Random Multiple-Access Algorithms
   
   Probl. Peredachi Inf., 21:2 (1985),  69–89
7. Random Multiple Access System with Impatient Packets
   
   Probl. Peredachi Inf., 20:4 (1984),  64–85
8. Packet Switching in a Channel without Feedback
   
   Probl. Peredachi Inf., 19:2 (1983),  69–84
9. Bounds for Packet Transmission Rate in a Random-Multiple-Access System
   
   Probl. Peredachi Inf., 19:1 (1983),  61–81
10. Upper Bound for the Delay in a Multiple-Random-Access System with a Splitting Algorithm
    
    Probl. Peredachi Inf., 18:4 (1982),  76–84