Oracle size: A new measure of difficulty for communication tasks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 179-187

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

^a CNRS   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

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

Author keywords

Broadcast; Oracle; Wakeup

Indexed keywords

COMPUTER NETWORKS; INFORMATION ANALYSIS; INFORMATION DISSEMINATION; KNOWLEDGE ACQUISITION; TELECOMMUNICATION NETWORKS; TOPOLOGY;

NETWORK TOPOLOGY; ORACLE; PARTIAL INFORMATION; WAKEUP;

DATABASE SYSTEMS;

EID: 33748706343     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. S. Abiteboul, H. Kaplan, and T. Milo, Compact labeling schemes for ancestor queries. Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), 547-556.
2. B. Awerbuch, O. Goldreich, D. Peleg and R. Vainish, A trade-off between information and communication in broadcast protocols, Journal of the ACM 37 (1990), 238-256.
3. M.A. Bender, A. Fernandez, D. Ron, A. Sahai and S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, Information and Computation 176 (2002), 1-21.
4. A.E.F. Clementi, A. Monti and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), 709-718.
5. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg, Labeling Schemes for Tree Representation. Proc. 7th Int. Workshop on Distributed Computing (IWDC 2005), LNCS 3741, 13-24.
6. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, McGraw-Hill, 1990.
7. A. Czumaj and W. Rytter, Broadcasting algorithms in radio networks with unknown topology, Proc. 44th Ann. Symposium on Foundations of Computer Science (FOCS 2003), 492-501.
8. A. Dessmark and A. Pelc, Optimal graph exploration without good maps, Theor. Comput. Sci. 326 (2004), 343-362.
9. F. Fich and E. Ruppert, Hundreds of impossibility results for distributed computing, Distributed Computing, 16 (2003), 121-163.
10. L. Gasieniec, D. Peleg, and Q. Xin, Faster communication in known topology radio networks, Proc. 24th Ann. ACM Symposium on Principles of Distributed Computing (PC-DC 2005), 129-137.
11. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz, Distance labeling in graphs. Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), 210-219.
12. T. Kameda and M. Yamashita, Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems, 7 (1996), 69-89.
13. M. Katz, N. Katz, A. Korman, and D. Peleg, Labeling schemes for flow and connectivity. Proc. 13th Ann. ACM-SIAM Symp. on Discrete algorithms (SODA 2002), 927-936.
14. E. Korach, S. Moran, and S. Zaks, 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.
15. E. Korach, S. Moran, and S. Zaks, Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. 64(1) (1989) 125-132.
16. A. Korman, S. Kutten, and D. Peleg, Proof labeling schemes. Proc. 24th Ann. ACM Symp. on Principles of Distributed Computing (PODC 2005), 9-18.
17. D. Kowalski and A. Pelc, Optimal deterministic broadcasting in known topology radio networks, manuscript.
18. F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
19. N. Lynch. A hundred impossibility proofs for distributed computing. Proc. 8th Ann. ACM Symposium on Principles of Distributed Computing (PODC 1989), 1-28.
20. M. Thorup and U. Zwick, Approximate distance oracles. Journal of the ACM 52(1) (2005), 1-24.