Local distributed decision

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 708-717

  Fraigniaud, Pierre ^a   Korman, Amos ^a   Peleg, David ^b  

^a CNRS   (France)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

local decision; local distributed algorithms; nondeterminism; oracles; randomized algorithms

Indexed keywords

COMMUNICATION ROUNDS; COMPLEXITY THEORY; COMPUTATIONAL COMPLEXITY THEORY; CONSTANT TIME; DECISION PROBLEMS; DISTRIBUTED DECISION; DISTRIBUTED NETWORKS; GLOBAL INPUT; INTRIGUING QUESTIONS; LOCAL DECISIONS; LOCAL MODEL; NON-DETERMINISM; ORACLES; RANDOMIZED ALGORITHMS; RESEARCH EFFORTS; SOLID BASIS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE;

PROBLEM SOLVING;

EID: 84860817492     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.17     Document Type: Conference Paper

References (43)

1. Y. Afek, S. Kutten, and M. Yung. The local detection paradigm and its applications to self stabilization. Theoretical Computer Science, 186(1-2):199-230, 1997.
2. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986.
3. A. Amit, N. Linial, J. Matousek, and E. Rozenman. Random lifts of graphs. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), 883-894, 2001.
4. B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-Stabilization By Local Checking and Correction. Proc. IEEE Symp. on the Foundations of Computer Science (FOCS), 1991, 268-277.
5. L. Barenboim and M. Elkin. Distributed (Δ + 1)-coloring in linear (in delta) time. Proc. 41st ACM Symp. on Theory of computing (STOC), 111-120, 2009.
6. T. D. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Systems. J. ACM, 43(2):225-267, 1996. (Pubitemid 126628035)
7. T. D. Chandra, V. Hadzilacos and S. Toueg. The Weakest Failure Detector for Solving Consensus. J. ACM, 43(4):685-722, 1996. (Pubitemid 126582610)
8. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg and R. Wattenhofer. Distributed Verification and Hardness of Distributed Approximation. Proc. 43rd ACM Symp. on Theory of Computing (STOC), 2011.
9. B. Derbel, C. Gavoille, D. Peleg and L. Viennot. Local computation of nearly additive spanners. Proc. 23rd Symp. on Distributed Computing (DISC), 176-190, (2009).
10. E.W. Dijkstra. Self-stabilization in spite of distributed control. Comm. ACM, 17(11), 643-644, 1974.
11. S. Dolev, M. Gouda, and M. Schneider. Requirements for silent stabilization. Acta Informatica, 36(6), 447-462, 1999.
12. M. Elkin and J. Zhang. Efficient algorithms for constructing (1 + ε,β)-spanners in the distributed and streaming models. Distrib.Comput., 18(5), 375-385 (2006).
13. M. J. Fischer, N. A. Lynch and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. J. ACM, 32(2): 374-382, 1985. (Pubitemid 15488351)
14. P. Fraigniaud, D Ilcinkas, and A. Pelc. Communication algorithms with advice. J. Comput. Syst. Sci., 76(3-4):222-232, 2008.
15. P. Fraigniaud, C. Gavoille, D. Ilcinkas and A. Pelc. Distributed Computing with Advice: Information Sensitivity of Graph Coloring. Proc. 34th Colloq. on Automata, Languages and Programming (ICALP), 231-242, 2007.
16. P. Fraigniaud, A Korman, and E. Lebhar. Local MST computation with short advice. Proc. 19th ACM Symp. on Parallelism in Alg. and Architectures (SPAA), 154-160, 2007.
17. P. Fraigniaud, S. Rajsbaum, and C. Travers. Wait-free checkable tasks. Proc. 25th Int. Symp. DIStributed Computing (DISC), 2011.
18. M. Göös and J. Suomela. Locally checkable proofs. Proc. 30th Symp. on Principles of Dist. Computing (PODC), 2011.
19. M. Herlihy. Wait-Free Synchronization. ACM Trans. Programming Languages and Systems, 13(1):124-149, 1991.
20. M. Hanckowiak, M. Karonski, and A. Panconesi. On the Distributed Complexity of Computing Maximal Matchings. SIAM J. Discrete Math. 15(1): 41-57 (2001).
21. L. Kor, A. Korman and D. Peleg. Tight Bounds For Distributed MST Verification. Proc. 28th Int. Symp. on Theoretical Aspects of Computer Science (STACS), 2011.
22. A. Korman and S. Kutten. Distributed verification of minimum spanning trees. Distributed Computing, 20:253-266, 2007. (Pubitemid 350005916)
23. A. Korman, S. Kutten and T. Masuzawa. Fast and Compact Self-Stabilizing Verification, Computation, and Fault Detection of an MST. Proc. 30th ACM Symp. on Principles of Distributed Computing (PODC), 2011.
24. A. Korman, S. Kutten, and D Peleg. Proof labeling schemes. Distributed Computing, 22:215-233, 2010.
25. A. Korman, J.S. Sereni, and L. Viennot. Toward More Localized Local Algorithms: Removing Assumptions Concerning Global Knowledge. Proc. 30th ACM Symp. on Principles of Distributed Computing (PODC), 2011.
26. F. Kuhn. Weak graph colorings: distributed algorithms and applications. proc. 21st ACM Symp. on Parallel Algorithms and Architectures (SPAA), 138-144, 2009.
27. F. Kuhn, T. Moscibroda, R. Wattenhofer. What cannot be computed locally! Proc. ACM Symp. on Principles of Distributed Computing (PODC), 2004, 300-309.
28. S. Kutten and D. Peleg. Fast distributed construction of small k-dominating sets and applications. J. Algorithms, 28(1):40-66, 1998. (Pubitemid 128638748)
29. F. Kuhn, and R. Wattenhofer. On the complexity of distributed graph coloring. Proc. 25th ACM Symp. on Principles of Distributed Computing (PODC), 7-15, 2006.
30. C. Lenzen, Y. A. Oswald and R. Wattenhofer. What can be approximated locally?: case study: dominating sets in planar graphs. In Proc. 20th Ann. ACM Symp. on Parallelism in Alg. and Architectures (SPAA), 46-54, 2008.
31. N. Linial. Locality in distributed graph algorithms. SIAM J. Comput., 21(1):193-201, 1992.
32. Z. Lotker, B. Patt-Shamir and A. Rosen. Distributed Approximate Matching. SIAM J. Comput. 39(2): 445-460, (2009).
33. Z. Lotker, B. Patt-Shamir and S. Pettie. Improved distributed approximate matching. Proc. 20th Ann. ACM Symp. on Parallelism in Alg. and Architectures (SPAA), 129-136, 2008.
34. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15:1036-1053, 1986. (Pubitemid 17465853)
35. M. Naor. A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. SIAM J. Discrete Math, 4(3): 409-412 (1991).
36. M. Naor and L. Stockmeyer. What can be computed locally? SIAM J. Comput. 24(6): 1259-1277 (1995).
37. A. Panconesi and A. Srinivasan. On the Complexity of Distributed Network Decomposition. J. Algorithms 20(2): 356-374, (1996).
38. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
39. D. Peleg and V. Rubinovich. A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM J. Comput., 30(5):1427-1442, 2000. (Pubitemid 33099783)
40. S. Pettie. Distributed algorithms for ultrasparse spanners and linear size skeletons. Dist. Comput., 22(3): 147-166 (2010).
41. J. Schneider and R. Wattenhofer. A new technique for distributed symmetry breaking. In Proc. 29th Symp. on Principles of Distributed Computing (PODC), 257-266, 2010.
42. D. Seinsche. On a property of the class of n-colorable graphs. J. Combinatorial Theory, Ser. B, 16, pages 191-193, 1974.
43. M. Wattenhofer and R. Wattenhofer. Distributed Weighted Matching. Proc. 18th Symp. on Distributed Computing (DISC), 335-348, 2004.