Communication algorithms with advice

Journal of Computer and System Sciences

Volumn 76, Issue 3-4, 2010, Pages 222-232

  Fraigniaud, Pierre ^a   Ilcinkas, David ^b   Pelc, Andrzej ^c  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Algorithm; Broadcasting; Graph; Message complexity; Network; Size of advice; Wakeup

Indexed keywords

ALGORITHMS; GRAPH ALGORITHMS; INFORMATION DISSEMINATION; NETWORKS (CIRCUITS);

COMMUNICATION ALGORITHMS; GRAPH; MESSAGE COMPLEXITY; SIZE OF ADVICE; WAKEUP;

BROADCASTING;

EID: 77950459667     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2009.07.002     Document Type: Article

References (29)

1. S. Abiteboul, H. Kaplan, T. Milo, Compact labeling schemes for ancestor queries, in: Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 547-556
2. Awerbuch B., Goldreich O., Peleg D., and Vainish R. A trade-off between information and communication in broadcast protocols. J. ACM 37 (1990) 238-256
3. Bender M.A., Fernandez A., Ron D., Sahai A., and Vadhan S. The power of a pebble: Exploring and mapping directed graphs. Inform. and Comput. 176 (2002) 1-21
4. 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
5. Cohen R., Fraigniaud P., Ilcinkas D., Korman A., and Peleg D. Labeling schemes for tree representation. Proc. 7th Int. Workshop on Distributed Computing. IWDC 2005. Lecture Notes in Comput. Sci. vol. 3741 (2005) 13-24
6. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), MIT Press, McGraw-Hill
7. A. Czumaj, W. Rytter, Broadcasting algorithms in radio networks with unknown topology, in: Proc. 44th Ann. Symposium on Foundations of Computer Science (FOCS 2003), pp. 492-501
8. Dessmark A., and Pelc A. Optimal graph exploration without good maps. Theoret. Comput. Sci. 326 (2004) 343-362
9. Elias P. Universal codeword sets and representations of the integers. IEEE Trans. Inform. Theory 21 2 (1975) 194-203
10. Emek Y., Gasieniec L., Kantor E., Pelc A., Peleg D., and Su C. Broadcasting time in UDG radio networks with unknown topology. Distributed Computing 21 (2009) 331-351
11. Y. Emek, E. Kantor, D. Peleg, On the effect of the deployment setting on broadcasting in Euclidean radio networks, in: Proc. 27th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2008), pp. 223-232
12. Fich F., and Ruppert E. Hundreds of impossibility results for distributed computing. Distributed Computing 16 (2003) 121-163
13. Fraigniaud P., Ilcinkas D., and Pelc A. Tree exploration with an oracle. Inform. and Comput. 206 (2008) 1276-1287
14. Fraigniaud P., Gavoille C., Ilcinkas D., and Pelc A. Distributed computing with advice: Information sensitivity of graph coloring. Distributed Computing 21 (2009) 395-403
15. 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
16. 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
17. L. Gasieniec, D. Peleg, Q. Xin, Faster communication in known topology radio networks, in: Proc. 24th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2005), pp. 129-137
18. C. Gavoille, D. Peleg, S. Pérennes, R. Raz, Distance labeling in graphs, in: Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 210-219
19. Ilcinkas D., Kowalski D., and Pelc A. Fast radio broadcasting with advice. Proc. 15th International Colloquium on Structural Information and Communication Complexity. SIROCCO 2008. Lecture Notes in Comput. Sci. vol. 5058 (2008) 291-305
20. Kameda T., and Yamashita M. Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems 7 (1996) 69-89
21. M. Katz, N. Katz, A. Korman, D. Peleg, Labeling schemes for flow and connectivity, in: Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), pp. 927-936
22. Korach E., Moran S., and Zaks S. The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. SIAM J. Comput. 16 2 (1987) 231-236
23. Korach E., Moran S., and Zaks S. Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoret. Comput. Sci. 64 1 (1989) 125-132
24. A. Korman, S. Kutten, D. Peleg, Proof labeling schemes, in: Proc. 24th Ann. ACM Symp. on Principles of Distributed Computing (PODC 2005), pp. 9-18
25. Kowalski D., and Pelc A. Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19 (2007) 185-195
26. Thomson Leighton F. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Morgan Kaufmann Publishers
27. N. Lynch, A hundred impossibility proofs for distributed computing, in: Proc. 8th Ann. ACM Symposium on Principles of Distributed Computing (PODC 1989), pp. 1-28
28. Nisse N., and Soguet D. Graph searching with advice. Proc. 14th International Colloquium on Structural Information and Communication Complexity. SIROCCO 2007. Lecture Notes in Comput. Sci. vol. 4474 (2007) 51-65
29. Thorup M., and Zwick U. Approximate distance oracles. J. ACM 52 1 (2005) 1-24