-
2
-
-
0026902215
-
On the time complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
-
Bar-Yehuda R., Goldreich O., Itai A. On the time complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. System Sci. 45:1992;104-126.
-
(1992)
J. Comput. System Sci.
, vol.45
, pp. 104-126
-
-
Bar-Yehuda, R.1
Goldreich, O.2
Itai, A.3
-
3
-
-
0027642528
-
Multiple communication in multihop radio networks
-
Bar-Yehuda R., Israeli A., Itai A. Multiple communication in multihop radio networks. SIAM J. Comput. 22:1993;875-887.
-
(1993)
SIAM J. Comput.
, vol.22
, pp. 875-887
-
-
Bar-Yehuda, R.1
Israeli, A.2
Itai, A.3
-
4
-
-
0031119011
-
Lower bounds for the broadcast problem in mobile radio networks
-
Bruschi D., Del Pinto M. Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10:1997;129-135.
-
(1997)
Distrib. Comput.
, vol.10
, pp. 129-135
-
-
Bruschi, D.1
Del Pinto, M.2
-
5
-
-
0022184360
-
On broadcasting in radio networks - Problem analysis and protocol design
-
Chlamtac I., Kutten S. On broadcasting in radio networks - Problem analysis and protocol design. IEEE Trans. Commun. 33:1985;1240-1246.
-
(1985)
IEEE Trans. Commun.
, vol.33
, pp. 1240-1246
-
-
Chlamtac, I.1
Kutten, S.2
-
6
-
-
0033886879
-
Deterministic broadcasting in unknown radio networks
-
Chlebus B.S., Ga̧sieniec L., Gibbons A., Pelc A., Rytter W. Deterministic broadcasting in unknown radio networks. Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA'2000. 2000;861-870.
-
(2000)
Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA'2000
, pp. 861-870
-
-
Chlebus, B.S.1
Ga̧sieniec, L.2
Gibbons, A.3
Pelc, A.4
Rytter, W.5
-
7
-
-
84983155164
-
Deterministic radio broadcasting
-
Berlin: Springer
-
Chlebus B.S., Ga̧sieniec L., Östlin A., Robson J.M. Deterministic radio broadcasting. Proc. 27th Internat. Coll. on Automata, Languages and Programming (ICALP'2000), July 2000, Geneva, Switzerland. Lecture Notes in Comput. Sci. 1853:2000;717-728 Springer, Berlin.
-
(2000)
Proc. 27th Internat. Coll. on Automata, Languages and Programming (ICALP'2000), July 2000, Geneva, Switzerland Lecture Notes in Comput. Sci.
, vol.1853
, pp. 717-728
-
-
Chlebus, B.S.1
Ga̧sieniec, L.2
Östlin, A.3
Robson, J.M.4
-
10
-
-
51249175955
-
Families of finite sets in which no set is covered by the union of r others
-
Erdös P., Frankl P., Füredi Z. Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51:1985;79-89.
-
(1985)
Israel J. Math.
, vol.51
, pp. 79-89
-
-
Erdös, P.1
Frankl, P.2
Füredi, Z.3
-
12
-
-
0022034656
-
A Perspective on multiaccess channels
-
Gallager R. A Perspective on multiaccess channels. IEEE Trans. Inform. Theory. 31:1985;124-142.
-
(1985)
IEEE Trans. Inform. Theory
, vol.31
, pp. 124-142
-
-
Gallager, R.1
-
14
-
-
0000227681
-
An Ω(Dlog(N/D)) lower bound for broadcast in radio networks
-
Kushilevitz E., Mansour Y. An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27:1998;702-712.
-
(1998)
SIAM J. Comput.
, vol.27
, pp. 702-712
-
-
Kushilevitz, E.1
Mansour, Y.2
-
16
-
-
0026106486
-
Deterministic sampling - A new technique for fast pattern matching
-
Vishkin U. Deterministic sampling - A new technique for fast pattern matching. SIAM J. Comput. 20:1991;22-40.
-
(1991)
SIAM J. Comput.
, vol.20
, pp. 22-40
-
-
Vishkin, U.1
|