-
1
-
-
0003267137
-
Conflict resolution in random access broadcast networks
-
Provincetown, MA, Sept
-
R. G. Gallager, “ Conflict resolution in random access broadcast networks,” in Proc. AFOSR Workshop Communications Theory and Applications, Provincetown, MA, Sept. 17–20, 1978, pp. 74–76.
-
(1978)
Proc. AFOSR Workshop Communications Theory and Applications
, pp. 17-20
-
-
Gallager, R.G.1
-
2
-
-
0041373881
-
Some tools for the study of channel-sharing algorithms
-
G. Longo, Ed., CISM Course and Lecture Series New York: Springer-Verlag
-
G. Ruget, “Some tools for the study of channel-sharing algorithms,” in Multi-User Communications, G. Longo, Ed., CISM Course and Lecture Series, no. 265. New York: Springer-Verlag; 1981, pp. 201–231.
-
(1981)
Multi-User Communications
, Issue.265
, pp. 201-231
-
-
Ruget, G.1
-
3
-
-
84909724805
-
Method of random multiple access
-
Tbilisi, Georgia, USSR, July
-
B. S. Tsybakov, M. A. Berkovskii, N. D. Vvedenskaja, V. A. Mikhailov, and S. P. Fedorzov,,” Method of random multiple access,” presented at Fifth Int. Symp. Information Theory, Tbilisi, Georgia, USSR, July 3–7, 1979.
-
(1979)
presented at Fifth Int. Symp. Information Theory
, pp. 3-7
-
-
Tsybakov, B.S.1
Berkovskii, M.A.2
Vvedenskaja, N.D.3
Mikhailov, V.A.4
Fedorzov, S.P.5
-
4
-
-
0021461359
-
Random multiple-access communication and group testing
-
July
-
T. Berger, N. Mehravari, D. Towsley, and J. K. Wolf, “Random multiple-access communication and group testing,” IEEE Trans. Commun., vol. COM-32, pp. 769–779, July 1984.
-
(1984)
IEEE Trans. Commun.
, vol.COM-32
, pp. 769-779
-
-
Berger, T.1
Mehravari, N.2
Towsley, D.3
Wolf, J.K.4
-
5
-
-
0018522043
-
Tree algorithm for packet broadcast channels
-
Sept
-
J. I. Capetanalds, “Tree algorithm for packet broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-25, no. 5, pp. 505–515, Sept. 1978.
-
(1978)
IEEE Trans. Inform. Theory
, vol.IT-25
, Issue.5
, pp. 505-515
-
-
Capetanalds, J.I.1
-
6
-
-
4243772579
-
Delay analysis of the modified 0.487 contention resolution algorithm
-
July submitted for publication
-
J. C. Huang and T. Berger, “Delay analysis of the modified 0.487 contention resolution algorithm,” Tech. Rep., School of Electrical Engineering, Cornell Univ., Ithaca, NY; IEEE Trans. Commun., July, 1984, submitted for publication.
-
(1984)
Tech. Rep., School of Electrical Engineering, Cornell Univ., Ithaca, NY; IEEE Trans. Commun.
-
-
Huang, J.C.1
Berger, T.2
-
7
-
-
85068944824
-
Interval-searching algorithms for multiaccess contention resolution: Delay and throughput
-
Cornell Univ., Ithaca, NY, Jan
-
J. C. Huang, “Interval-searching algorithms for multiaccess contention resolution: Delay and throughput,” Ph.D. dissertation, School of Electrical Engineering, Cornell Univ., Ithaca, NY, Jan. 1985.
-
(1985)
Ph.D. dissertation, School of Electrical Engineering
-
-
Huang, J.C.1
-
8
-
-
84915343402
-
A conflict resolution algorithm with multibit feedback
-
Dec submitted for publication
-
T. Berger and J. C. Huang, “A conflict resolution algorithm with multibit feedback,” Tech. Rep., School of Electrical, Engineering, Cornell Univ., Ithaca, NY; IEEE Trans. Inform. Theory, Dec. 1983, submitted for publication.
-
(1983)
Tech. Rep., School of Electrical, Engineering, Cornell Univ., Ithaca, NY; IEEE Trans. Inform. Theory
-
-
Berger, T.1
Huang, J.C.2
-
9
-
-
85068944823
-
-
private communication, Nov
-
J. L. Massey, private communication, Nov. 1984.
-
-
-
Massey, J.L.1
-
10
-
-
84555217663
-
Upper bound for the delay in a multiple-random-access system with a splitting algorithm
-
Oct.—Dec
-
B. S. Tsybakov and N. B. Likhanov, “Upper bound for the delay in a multiple-random-access system with a splitting algorithm,” Problemy Peredachi Informatsii, vol. 18, no. 4, pp. 76–84, Oct.—Dec., 1982.
-
(1982)
Problemy Peredachi Informatsii
, vol.18
, Issue.4
, pp. 76-84
-
-
Tsybakov, B.S.1
Likhanov, N.B.2
|