Locally checkable proofs
暂无分享,去创建一个
[1] L. Beineke. Characterizations of derived graphs , 1970 .
[2] Ronald Fagin. Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .
[3] M. Simonovits,et al. Cycles of even length in graphs , 1974 .
[4] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.
[5] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[6] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[7] Ronald Fagin,et al. Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[8] Moni Naor,et al. What can be computed locally? , 1993, STOC.
[9] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..
[10] Thomas Schwentick,et al. Graph connectivity and monadic NP , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Reinhard Diestel,et al. Graph Theory , 1997 .
[12] Thomas Schwentick,et al. Local Normal Forms for First-Order Logic with Applications to Games and Automata , 1998, Discret. Math. Theor. Comput. Sci..
[13] Neil Immerman,et al. Descriptive Complexity , 1999, Graduate Texts in Computer Science.
[14] Jirí Matousek,et al. Random lifts of graphs , 2001, SODA '01.
[15] David Peleg,et al. Compact and localized distributed data structures , 2003, Distributed Computing.
[16] Distributed verification of minimum spanning trees , 2006, PODC '06.
[17] David Peleg,et al. Constructing Labeling Schemes Through Universal Matrices , 2006, ISAAC.
[18] Shay Kutten,et al. On Distributed Verification , 2006, ICDCN.
[19] Andrzej Pelc,et al. Distributed computing with advice: information sensitivity of graph coloring , 2007, Distributed Computing.
[20] Pierre Fraigniaud. Distributed computational complexities: are you volvo-addicted or nascar-obsessed? , 2010, PODC '10.
[21] Shay Kutten,et al. Proof labeling schemes , 2005, PODC '05.
[22] Jukka Suomela,et al. Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks , 2010, SPAA '10.
[23] A. Razborov. Communication Complexity , 2011 .
[24] Toshimitsu Masuzawa,et al. Fast and compact self-stabilizing verification, computation, and fault detection of an MST , 2011, PODC '11.
[25] Pierre Fraigniaud,et al. Local Distributed Decision , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[26] Jukka Suomela,et al. Survey of local algorithms , 2013, CSUR.
[27] P. Erdös. ASYMMETRIC GRAPHS , 2022 .