Fast radio broadcasting with advice

Alon, 1991, A lower bound for radio broadcast, Journal of Computer and System Sciences, 43, 290, 10.1016/0022-0000(91)90015-W Bar-Yehuda, 1992, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences, 45, 104, 10.1016/0022-0000(92)90042-H Brito, 2004, An information theoretic lower bound for broadcasting in radio networks, vol. 2996, 534 Bruschi, 1997, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing, 10, 129, 10.1007/s004460050030 Chlamtac, 1985, On broadcasting in radio networks - problem analysis and protocol design, IEEE Transactions on Communications, 33, 1240, 10.1109/TCOM.1985.1096245 Chlamtac, 1991, The wave expansion approach to broadcasting in multihop radio networks, IEEE Transactions on Communications, 39, 426, 10.1109/26.79285 Chlebus, 2002, Deterministic broadcasting in unknown radio networks, Distributed Computing, 15, 27, 10.1007/s446-002-8028-1 Chlebus, 2000, Deterministic radio broadcasting, vol. 1853, 717 M. Chrobak, L. Ga̧sieniec, W. Rytter, Fast broadcasting and gossiping in radio networks, in: Proc. 41st Symposium on Foundations of Computer Science, FOCS 2000, pp. 575–581 A.E.F. Clementi, A. Monti, R. Silvestri, 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 A. Czumaj, W. Rytter, Broadcasting algorithms in radio networks with unknown topology. in: Proc. 44th Symposium on Foundations of Computer Science, FOCS, 2003, pp. 492–501 G. De Marco, Distributed broadcast in unknown radio networks, in: Proc. 19th ACM-SIAM Symp. on Discrete Algorithms, SODA, 2008 Dessmark, 2007, Broadcasting in geometric radio networks, Journal of Discrete Algorithms, 5, 187, 10.1016/j.jda.2006.07.001 Diks, 2002, The impact of knowledge on broadcasting time in linear radio networks, Theoretical Computer Science, 287, 449, 10.1016/S0304-3975(01)00256-0 M. Elkin, G. Kortsarz, Improved broadcast schedule for radio networks, in: Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, SODA, 2005 Y. Emek, L. Gasieniec, E. Kantor, A. Pelc, D. Peleg, C. Su, 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 P. Fraigniaud, D. Ilcinkas, A. Pelc, 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 Fraigniaud, 2008, Tree exploration with advice, Information and Computation, 206, 1276, 10.1016/j.ic.2008.07.005 Fraigniaud, 2007, Distributed computing with advice: Information sensitivity of graph coloring, vol. 4596, 231 P. Fraigniaud, A. Korman, E. Lebhar, Local MST computation with short advice, in: Proc. 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, 2007, pp. 154–160 E. Fusco, A. Pelc, Trade-offs between the size of advice and broadcasting time in trees, in: Proc. 20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, 2008, pp. 77–84 Gaber, 2003, Centralized broadcast in multihop radio networks, Journal of Algorithms, 46, 1, 10.1016/S0196-6774(02)00292-4 L. Ga̧sieniec, D. Peleg, Q. Xin, Faster communication in known topology radio networks, in: Proc. 24th Annual ACM Symposium on Principles Of Distributed Computing, PODC, 2005, pp. 129–137 Ga̧sieniec, 2001, The wakeup problem in synchronous broadcast systems, SIAM Journal on Discrete Mathematics, 14, 207, 10.1137/S0895480100376022 Kowalski, 2004, Time of deterministic broadcasting in radio networks with local knowledge, SIAM Journal on Computing, 33, 870, 10.1137/S0097539702419339 Kowalski, 2005, Time complexity of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism, Theoretical Computer Science, 333, 355, 10.1016/j.tcs.2004.04.017 Kowalski, 2005, Broadcasting in undirected ad hoc radio networks, Distributed Computing, 18, 43, 10.1007/s00446-005-0126-7 Kowalski, 2007, Optimal deterministic broadcasting in known topology radio networks, Distributed Computing, 19, 185, 10.1007/s00446-006-0007-8 Kushilevitz, 1998, An Ω(Dlog(N/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing, 27, 702, 10.1137/S0097539794279109 Nisse, 2007, Graph searching with advice, vol. 4474, 51 Ravishankar, 1994, Broadcasting on [0,L], Discrete Applied Mathematics, 53, 299, 10.1016/0166-218X(94)90193-7 A. Sen, M.L. Huson, A new model for scheduling packet radio networks, in: Proc. 15th Annual Joint Conference of the IEEE Computer and Communication Societies, IEEE INFOCOM, 1996, pp. 1116–1124