-
1
-
-
38249013511
-
Single round simulation of radio networks
-
N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, Single round simulation of radio networks, J. Algorithms, 13 (1992), pp. 188-210.
-
(1992)
J. Algorithms
, vol.13
, pp. 188-210
-
-
Alon, N.1
Bar-Noy, A.2
Linial, N.3
Peleg, D.4
-
2
-
-
0026902215
-
On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomisation
-
R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomisation, J. Computer and System Sciences, 45 (1992), pp. 104-126.
-
(1992)
J. Computer and System Sciences
, vol.45
, pp. 104-126
-
-
Bar-Yehuda, R.1
Goldreich, O.2
Itai, A.3
-
3
-
-
0027642528
-
Multiple communication in multi-hop radio networks
-
R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM J. on Computing, 22 (1993), pp. 875-887.
-
(1993)
SIAM J. on Computing
, vol.22
, pp. 875-887
-
-
Bar-Yehuda, R.1
Israeli, A.2
Itai, A.3
-
4
-
-
0006109157
-
Randomized communication in radio networks
-
a chapter in, P.M. Pardalos, S. Rajasekaran, J.H. Reif, and J.D.P. Rolim, (Eds.), Kluwer Academic Publishers, to appear
-
B.S. Chlebus, Randomized communication in radio networks, a chapter in "Handbook on Randomized Computing," P.M. Pardalos, S. Rajasekaran, J.H. Reif, and J.D.P. Rolim, (Eds.), Kluwer Academic Publishers, to appear.
-
Handbook on Randomized Computing
-
-
Chlebus, B.S.1
-
5
-
-
0033886879
-
Deterministic broadcasting in unknown radio networks
-
San Francisco, California
-
B.S. Chlebus, L. Ga̧sieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, in Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 2000, pp. 861-870.
-
(2000)
Proc. 11th ACM-SIAM Symp. on Discrete Algorithms
, pp. 861-870
-
-
Chlebus, B.S.1
Ga̧sieniec, L.2
Gibbons, A.M.3
Pelc, A.4
Rytter, W.5
-
7
-
-
84983155164
-
Deterministic radio broad-casting
-
Geneva, Switzerland, Springer LNCS 1853
-
B.S. Chlebus, L. Ga̧sieniec, A. Östlin, and J.M. Robson, Deterministic radio broad-casting, in Proc. 27th Int. Colloquium on Automata, Languages and Programming, Geneva, Switzerland, 2000, Springer LNCS 1853, pp. 717-728.
-
(2000)
Proc. 27th Int. Colloquium on Automata, Languages and Programming
, pp. 717-728
-
-
Chlebus, B.S.1
Ga̧sieniec, L.2
Östlin, A.3
Robson, J.M.4
-
9
-
-
0034497860
-
Fast broadcasting and gossiping in radio networks
-
Redondo Beach, California
-
M. Chrobak, L. Ga̧sieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, in Proc. 41st IEEE Symp. on Foundations of Computer Science, Redondo Beach, California, 2000, pp. 575-581.
-
(2000)
Proc. 41st IEEE Symp. on Foundations of Computer Science
, pp. 575-581
-
-
Chrobak, M.1
Ga̧sieniec, L.2
Rytter, W.3
-
10
-
-
0034776380
-
Distributed multi-broadcast in unknown radio networks
-
Newport, Rhode Island
-
A.E.F. Clementi, A. Monti, and R. Silvestri, Distributed multi-broadcast in unknown radio networks, in Proc., 20th ACM Symp. on Principles of Distributed Computing, 2001, Newport, Rhode Island, pp. 255-264.
-
(2001)
Proc., 20th ACM Symp. on Principles of Distributed Computing
, pp. 255-264
-
-
Clementi, A.E.F.1
Monti, A.2
Silvestri, R.3
-
11
-
-
65549143661
-
Selective families, superimposed codes, and broadcasting in unknown radio networks
-
Washington, DC
-
A.E.F. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting in unknown radio networks, in Proc., 12th ACM-SIAM Symp. on Discrete Algorithms, Washington, DC, 2001, pp. 709-718.
-
(2001)
Proc., 12th ACM-SIAM Symp. on Discrete Algorithms
, pp. 709-718
-
-
Clementi, A.E.F.1
Monti, A.2
Silvestri, R.3
-
12
-
-
84943237670
-
Round robin is optimal for faulttolerant broadcasting on wireless networks
-
BRICS, University of Aarhus, Denmark, (ESA'2001)
-
A.E.F. Clementi, A. Monti, and R. Silvestri, Round robin is optimal for faulttolerant broadcasting on wireless networks, In Proc., 9th Ann. European Symposium on Algorithms, BRICS, University of Aarhus, Denmark, (ESA'2001), pp. 452-463.
-
Proc., 9th Ann. European Symposium on Algorithms
, pp. 452-463
-
-
Clementi, A.E.F.1
Monti, A.2
Silvestri, R.3
-
13
-
-
0035973451
-
Faster broadcasting in unknown radio networks
-
G. De Marco, and A. Pelc, Faster broadcasting in unknown radio networks, Information Processing Letters, 79(2), pp. 53-56.
-
Information Processing Letters
, vol.79
, Issue.2
, pp. 53-56
-
-
De Marco, G.1
Pelc, A.2
-
14
-
-
34748850337
-
On adaptive deterministic gossiping in ad hoc radio networks
-
San Francisco
-
L. Ga̧sieniec and A. Lingas, On adaptive deterministic gossiping in ad hoc radio networks, In Proc., 13th ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 2002, pp. 689-690.
-
(2002)
Proc., 13th ACM-SIAM Symp. on Discrete Algorithms
, pp. 689-690
-
-
Ga̧sieniec, L.1
Lingas, A.2
-
16
-
-
0037962389
-
Explicit construction of selectors and related combinatorial structures with applications
-
San Francisco
-
P. Indyk, Explicit construction of selectors and related combinatorial structures with applications, In Proc., 13th ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 2002, pp. 697-704.
-
(2002)
Proc., 13th ACM-SIAM Symp. on Discrete Algorithms
, pp. 697-704
-
-
Indyk, P.1
-
17
-
-
0000227681
-
An Ω(Dlog(N/D)) lower bound for broadcast in radio networks
-
E. Kushilevitz, and Y. Mansour, An Ω(Dlog(N/D)) lower bound for broadcast in radio networks, SIAM J. on Computing, 27 (1998), pp. 702-712.
-
(1998)
SIAM J. on Computing
, vol.27
, pp. 702-712
-
-
Kushilevitz, E.1
Mansour, Y.2
|