1. Tsybakov, B.S. and Mikhailov, V.A., Free Synchronous Packet Access in a Broadcast Channel with Feedback, Probl. Peredachi Inf., 1978, vol. 14, no. 4, pp. 32–59 [Probl. Inf. Trans. (Engl. Transl.), 1978, vol. 14, no. 4, pp. 259–280].
2. Capetanakis, J.I., Tree Algorithms for Packet Broadcast Channels, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 5, pp. 505–515.
3. Mehravari, N. and Berger, T., Poisson Multiple-Access Contention with Binary Feedback, IEEE Trans. Inform. Theory, 1984, vol. 30, no. 5, pp. 745–751.
4. Tsybakov, B.S. and Beloyarov, A.N., Random Multiple Access in a Channel with Binary “Success-No Success” Feedback, Probl. Peredachi Inf., 1990, vol. 26, no. 3, pp. 67–82 [Probl. Inf. Trans. (Engl. Transl.), 1990, vol. 26, no. 3, pp. 245–260].
5. Tsybakov, B.S. and Beloyarov, A.N., Random Multiple Access in Binary Feedback Channel, Probl. Peredachi Inf., 1990, vol. 26, no. 4, pp. 83–98 [Probl. Inf. Trans. (Engl. Transl.), 1990, vol. 26, no. 4, pp. 354–366].