[1] Abramson, N., The ALOHA system-another alternative for computer communications, Proc. AFIPS Conf. Fall Joint Comp. Conf., 37(1970), 281-285.
[2] Capetanakis, J.I., Tree Algorithms for packet Broadcast Channels, IEEE Trans. Inf. Th., IT-25, 5(1979), 505-515.
[3] Tsybakov, B.S. and V.A. Mikhailov, Free Synchronous Packet Access in a Broadcast Channel with FeedbaCk, Proc. of Inf. Trans., 14, Oct.-Dec.(1978), 32-59.
[4] Mehravari, N. and T. Berger, Poisson multiple-access contention with binary feedback, IEEE Trans. Inf. Th., IT-30, 5(1985), 745-751.
[5] Hofri, M., Stack Algorithms for Collision-Detecting Channels and Their Analysis: A limited survey, Proceedings of the International Seminar, Paris, France edited by F. Baccelli and G. Fayolle, Springer-Verlag, January(1983).
[6] Fayolle, G. and M. Hofri, On the capacity ora collision resolution channel under stack-based collision resolution algorithms, Technion, Haifa, Israel, Rep. 237, Oct.(1983).
[7] Fayolle, G., P. Flajolet, M. Hofri, and P. Jacquet, Analysis of a stack algorithm for random multiple-access communication, IEEE Trans. Inf. Th., IT-31, 2, March(1985), 244-254.
[8] Mathys, P. and P. Elajolet, Q-ary collision resolution algorithms in random-access system with free or blocked channel access, IEEE Trans. Inf. Th.,IT-31, 2, March(1985), 217-243.
[9] Fayolle, G., P. Flajolet, and M. Hofri, On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel, Internal Rep. 131, INRIA, France, Apr.(1982).
[10] Massey, J.L. and P. Mathys, The collision channel without feedback, IEEE Trans. Inf. Th., IT-31, 2, March(1985), 192-204.
[11] Tsybakov, B.S., Resolution of conflict with known multiplicity, Problem Peredach. Inform., 16, 2. Apr.-June(1980), 69-82.(in Russian)
[12] Georgiadis, L. and P.Papantoni-Kazakos, A collision resolution protocol for random access channel with energy detectors, IEEE Trans. Com., Com-30, 11(1982), 2413-2420.
[13] Tsybakov, B.S., Survey of USSS contributions to random multiple-access communications, IEEE Trans. Inf. Th., IT-31, 2, March(1985). |