Locally checkable proofs

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 159-168

  Göös, Mika ^a   Suomela, Jukka ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

decision problems; graph properties; local algorithms; nondeterministic algorithms; proof complexity

Indexed keywords

DECISION PROBLEMS; GRAPH PROPERTIES; LOCAL ALGORITHM; NONDETERMINISTIC ALGORITHMS; PROOF COMPLEXITY;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; ENGINEERING RESEARCH;

GRAPH THEORY;

EID: 79959892593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993829     Document Type: Conference Paper

References (23)

1. Miklos Ajtai and Ronald Fagin. Reachability is harder for directed than for undirected finite graphs. The Journal of Symbolic Logic, 55(1):113-150, 1990.
2. Dana Angluin. Local and global properties in networks of processors. In Proc. 12th Symposium on Theory of Computing (STOC 1980), pages 82-93. ACM Press, 1980.
3. Lowell W. Beineke. Characterizations of derived graphs. Journal of Combinatorial Theory, 9(2):129-135, 1970.
4. John A. Bondy and Miklós Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16(2):97-105, 1974.
5. Reinhard Diestel. Graph Theory. Springer, 3rd edition, 2005.
6. Paul Erdo{combining double acute accent}s and Alfréd Rényi. Asymmetric graphs. Acta Mathematica Hungarica, 14:295-315, 1963.
7. Ronald Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. Karp, editor, Complexity of Computation, volume 7, pages 43-73. 1974.
8. Pierre Fraigniaud. Distributed computational complexities: are you Volvo-addicted or NASCAR-obsessed? In Proc. 29th Symposium on Principles of Distributed Computing (PODC 2010), pages 171-172. ACM Press, 2010.
9. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, and Andrzej Pelc. Distributed computing with advice: Information sensitivity of graph coloring. In Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), volume 4596 of LNCS, pages 231-242. Springer, 2007.
10. Pierre Fraigniaud, Amos Korman, and David Peleg. Local distributed decision, 2010. Manuscript, arXiv:1011.2152 [cs.DC].
11. Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Distributed Computing, 16(2-3):111-120, 2003.
12. Mika Göös and Jukka Suomela. Locally checkable proofs. http://www.iki.fi/jukka.suomela/lcp, 2011. Manuscript.
13. Neil Immerman. Descriptive Complexity. Springer, 1999.
14. Amos Korman and Shay Kutten. On distributed verification. In Proc. 8th International Conference on Distributed Computing and Networking (ICDCN 2006), volume 4308 of LNCS, pages 100-114. Springer, 2006.
15. Amos Korman and Shay Kutten. Distributed verification of minimum spanning trees. Distributed Computing, 20(4):253-266, 2007.
16. Amos Korman, Shay Kutten, and David Peleg. Proof labeling schemes. In Proc. 24th Symposium on Principles of Distributed Computing (PODC 2005), pages 9-18. ACM Press, 2005.
17. Amos Korman, David Peleg, and Yoav Rodeh. Constructing labeling schemes through universal matrices. Algorithmica, 57(4):641-652, 2010.
18. Moni Naor and Larry Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24(6):1259-1277, 1995.
19. David Peleg. Distributed Computing - A Locality-Sensitive Approach. SIAM, 2000.
20. Thomas Schwentick. Graph connectivity and monadic NP. In Proc. 35th Symposium on Foundations of Computer Science (FOCS 1994), pages 614-622. IEEE, 1994.
21. Thomas Schwentick and Klaus Barthelmann. Local normal forms for first-order logic with applications to games and automata. Discrete Mathematics and Theoretical Computer Science, 3:109-124, 1999.
22. N. J. A. Sloane. The on-line encyclopedia of integer sequences. http://oeis.org, 2010.
23. Jukka Suomela. Survey of local algorithms. http://www.iki.fi/jukka. suomela/local-survey, 2011. Manuscript submitted for publication.