-
1
-
-
0026238585
-
A lower bound for radio broadcast
-
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Sciences 43, 290-298 (1991)
-
(1991)
Journal of Computer and System Sciences
, vol.43
, pp. 290-298
-
-
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 randomization
-
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences 45, 104-126 (1992)
-
(1992)
Journal of Computer and System Sciences
, vol.45
, pp. 104-126
-
-
Bar-Yehuda, R.1
Goldreich, O.2
Itai, A.3
-
3
-
-
35048886533
-
An information theoretic lower bound for broadcasting in radio networks
-
Diekert, V, Habib, M, eds, STACS 2004, Springer, Heidelberg
-
Brito, C., Gafni, E., Vaya, S.: An information theoretic lower bound for broadcasting in radio networks. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 534-546. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.2996
, pp. 534-546
-
-
Brito, C.1
Gafni, E.2
Vaya, S.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. Distributed Computing 10, 129-135 (1997)
-
(1997)
Distributed Computing
, 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 Transactions on Communications 33, 1240-1246 (1985)
-
(1985)
IEEE Transactions on Communications
, vol.33
, pp. 1240-1246
-
-
Chlamtac, I.1
Kutten, S.2
-
6
-
-
0026122424
-
The wave expansion approach to broadcasting in multihop radio networks
-
Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Transactions on Communications 39, 426-433 (1991)
-
(1991)
IEEE Transactions on Communications
, vol.39
, pp. 426-433
-
-
Chlamtac, I.1
Weinstein, O.2
-
7
-
-
0036266570
-
Deterministic broadcasting in unknown radio networks
-
Chlebus, B., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15, 27-38 (2002)
-
(2002)
Distributed Computing
, vol.15
, pp. 27-38
-
-
Chlebus, B.1
Ga̧sieniec, L.2
Gibbons, A.3
Pelc, A.4
Rytter, W.5
-
8
-
-
84983155164
-
Deterministic radio broadcasting
-
Welzl, E, Montanari, U, Rolim, J.D.P, eds, ICALP 2000, Springer, Heidelberg
-
Chlebus, B., Ga̧sieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 717-728. Springer, Heidelberg (2000)
-
(2000)
LNCS
, vol.1853
, pp. 717-728
-
-
Chlebus, B.1
Ga̧sieniec, L.2
Östlin, A.3
Robson, J.M.4
-
9
-
-
1842434511
-
The wake-up problem in multi-hop radio networks
-
Chrobak, M., Ga̧sieniec, L., Kowalski, D.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 985-993 (2004)
-
(2004)
Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA
, pp. 985-993
-
-
Chrobak, M.1
Ga̧sieniec, L.2
Kowalski, D.3
-
10
-
-
65549143661
-
Selective families, superimposed codes, and broadcasting on unknown radio networks
-
Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 709-718 (2001)
-
(2001)
Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA
, pp. 709-718
-
-
Clementi, A.E.F.1
Monti, A.2
Silvestri, R.3
-
14
-
-
0037190365
-
The impact of knowledge on broadcasting time in linear radio networks
-
Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of knowledge on broadcasting time in linear radio networks. Theoretical Computer Science 287, 449-471 (2002)
-
(2002)
Theoretical Computer Science
, vol.287
, pp. 449-471
-
-
Diks, K.1
Kranakis, E.2
Krizanc, D.3
Pelc, A.4
-
16
-
-
36849021555
-
Broadcasting time in UDG radio networks with unknown topology
-
Emek, Y., Gasieniec, L., Kantor, E., Pelc, A., Peleg, D., Su, C: Broadcasting time in UDG radio networks with unknown topology. In: Proc. 26th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 195-204 (2007)
-
(2007)
Proc. 26th Ann. ACM Symposium on Principles of Distributed Computing (PODC
, pp. 195-204
-
-
Emek, Y.1
Gasieniec, L.2
Kantor, E.3
Pelc, A.4
Peleg, D.5
Su, C.6
-
17
-
-
33748706343
-
Oracle size: A new measure of difficulty for communication problems
-
Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication problems. In: Proc. 25th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 179-187 (2006)
-
(2006)
Proc. 25th Ann. ACM Symposium on Principles of Distributed Computing (PODC
, pp. 179-187
-
-
Fraigniaud, P.1
Ilcinkas, D.2
Pelc, A.3
-
18
-
-
33750060704
-
-
Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with an oracle. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, 4162, pp. 24-37. Springer, Heidelberg (2006)
-
Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with an oracle. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 24-37. Springer, Heidelberg (2006)
-
-
-
-
19
-
-
38149130511
-
Distributed computing with advice: Information sensitivity of graph coloring
-
Arge, L, Cachin, C, Jurdziński, T, Tarlecki, A, eds, ICALP 2007, Springer, Heidelberg
-
Fraigniaud, P., Ilcinkas, D., Gavoille, C., Pelc, A.: Distributed computing with advice: Information sensitivity of graph coloring. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 231-242. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4596
, pp. 231-242
-
-
Fraigniaud, P.1
Ilcinkas, D.2
Gavoille, C.3
Pelc, A.4
-
20
-
-
35248882024
-
Local MST computation with short advice
-
Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. In: Proc. 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), pp. 154-160 (2007)
-
(2007)
Proc. 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA
, pp. 154-160
-
-
Fraigniaud, P.1
Korman, A.2
Lebhar, E.3
-
21
-
-
0037222272
-
Centralized broadcast in multihop radio networks
-
Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. Journal of Algorithms 46, 1-20 (2003)
-
(2003)
Journal of Algorithms
, vol.46
, pp. 1-20
-
-
Gaber, I.1
Mansour, Y.2
-
22
-
-
32344448716
-
Faster communication in known topology radio networks
-
Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th Annual ACM Symposium on Principles Of Distributed Computing (PODC 2005), pp. 129-137 (2005)
-
(2005)
Proc. 24th Annual ACM Symposium on Principles Of Distributed Computing (PODC
, pp. 129-137
-
-
Gasieniec, L.1
Peleg, D.2
Xin, Q.3
-
23
-
-
0009219083
-
The wakeup problem in synchronous broadcast systems
-
Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics 14, 207-222 (2001)
-
(2001)
SIAM Journal on Discrete Mathematics
, vol.14
, pp. 207-222
-
-
Gasieniec, L.1
Pelc, A.2
Peleg, D.3
-
24
-
-
4544330060
-
Time of deterministic broadcasting in radio networks with local knowledge
-
Kowalski, D., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing 33, 870-891 (2004)
-
(2004)
SIAM Journal on Computing
, vol.33
, pp. 870-891
-
-
Kowalski, D.1
Pelc, A.2
-
25
-
-
13844255683
-
Time complexity of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism
-
Kowalski, D., Pelc, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333, 355-371 (2005)
-
(2005)
Theoretical Computer Science
, vol.333
, pp. 355-371
-
-
Kowalski, D.1
Pelc, A.2
-
26
-
-
27844547602
-
Broadcasting in undirected ad hoc radio networks
-
Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18, 43-57 (2005)
-
(2005)
Distributed Computing
, vol.18
, pp. 43-57
-
-
Kowalski, D.1
Pelc, A.2
-
27
-
-
33751524903
-
Optimal deterministic broadcasting in known topology radio networks
-
Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19, 185-195 (2007)
-
(2007)
Distributed Computing
, vol.19
, pp. 185-195
-
-
Kowalski, D.1
Pelc, A.2
-
28
-
-
0000227681
-
An Ω(D log(N/D)) lower bound for broadcast in radio networks
-
Kushilevitz, E., Mansour, Y.: An Ω(D log(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing 27, 702-712 (1998)
-
(1998)
SIAM Journal on Computing
, vol.27
, pp. 702-712
-
-
Kushilevitz, E.1
Mansour, Y.2
-
30
-
-
38049138879
-
Graph searching with advice
-
Prencipe, G, Zaks, S, eds, SIROCCO 2007, Springer, Heidelberg
-
Soguet, D., Nisse, N.: Graph searching with advice. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 51-65. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4474
, pp. 51-65
-
-
Soguet, D.1
Nisse, N.2
|