An optimal bit complexity randomized distributed MIS algorithm (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5869 LNCS, Issue , 2010, Pages 323-337

  Yves, Métivier ^a   Robson, John Michael ^a   Nasser, Saheb Djahromi ^a   Zemmari, Akka ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

ARBITRARY GRAPHS; COMMUNICATION COMPLEXITY; COUNTER EXAMPLES; DISTRIBUTED TASKS; EXTENDED ABSTRACTS; MAXIMAL INDEPENDENT SET; MULTIPLICATIVE CONSTANTS; PRAM ALGORITHMS;

COMPLEX NETWORKS;

EID: 77949459118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11476-2_25     Document Type: Conference Paper

References (21)

1. [ABI86] Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set. Journal of Algorithms 7(4), 567-583 (1986)
2. [AGLP89] Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: Proceedings of the 30th ACM Symposium on FOCS, pp. 364-369. ACM Press, New York (1989)
3. [BMW94] Bodlaender, H.L., Moran, S., Warmuth, M.K.: The distributed bit complexity of the ring: from the anonymous case to the non-anonymous case. Information and computation 114(2), 34-50 (1994)
4. [DMR08] Dinitz, Y., Moran, S., Rajsbaum, S.: Bit complexity of breaking and achieving symmetry in chains and rings. Journal of the ACM 55(1) (2008)
5. [Gho06] Ghosh, S.: Distributed systems - An algorithmic approach. CRC Press, Boca Raton (2006)
6. [KMNW05] Kuhn, F., Moscibroda, T., Nieberg, T.,Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 273-287. Springer, Heidelberg (2005)
7. [KMW04] Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of the 24 Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 300-309 (2004)
8. [KN99] Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1999)
9. [KOSS06] Kothapalli, K., Onus, M., Scheideler, C., Schindelhauer, C.: Distributed coloring in o/spltilde/(/splradic/(logn) ) bit rounds. In: Proceedings of 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes Island, Greece, April 25-29. IEEE, Los Alamitos (2006)
10. [KW84] Karp, R.M., Widgerson, A.: A fast parallel algorithm for the maximal independent set problem. In: Proceedings of the 16th ACM Symposium on Theory of computing (STOC), pp. 266-272. ACM Press, New York (1984)
11. [KW06] Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: Proceedings of the 25 Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 7-15. ACM Press, New York (2006)
12. [Lin92] Linial, N.: Locality in distributed graph algorithms. SIAMJ. Comput. 21, 193-201 (1992)
13. [Lub86] Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036-1053 (1986)
14. [Lyn96] Lynch, N.A.: Distributed algorithms. Morgan Kaufmann, San Francisco (1996)
15. [MW05] Moscibroda, T., Wattenhofer, R.: Maximal independent set in radio networks. In: Proceedings of the 25 Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 148-157. ACM Press, New York (2005)
16. [NS95] Naor, M., Stockmeyer, L.J.: What can be computed locally? SIAM J. Comput. 24(6), 1259-1277 (1995)
17. [Pel00] Peleg, D.: Distributed computing - A Locality-sensitive approach. SIAM Monographs on discrete mathematics and applications (2000)
18. [San07] Santoro, N.: Design and analysis of distributed algorithms. Wiley, Chichester (2007)
19. [Tel00] Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)
20. [Wat07] Wattenhofer, R. (2007), http://dcg.ethz.ch/lectures/fs08/ distcomp/lecture/chapter4.pdf
21. [Yao79] Yao, A.C.: Some complexity questions related to distributed computing. In: Proceedings of the 11th ACM Symposium on Theory of computing (STOC), pp. 209-213. ACM Press, New York (1979)