|
11
|
Local Normal Forms for First-Order Logic with Applications to Games and Automata
– Thomas Schwentick, Klaus Barthelmann
- 1998
|
|
7
|
Proof Labeling Schemes
– Amos Korman, Shay Kutten, David Peleg
- 2005
|
|
18
|
Graph Connectivity and Monadic NP
– Thomas Schwentick
- 1994
|
|
15
|
Characterizations of derived graphs
– Lowell W Beineke
- 1970
|
|
3
|
Survey of local algorithms. http://www.iki.fi/jukka. suomela/local-survey
– Jukka Suomela
- 2009
|
|
1
|
Erdős and Alfréd Rényi. Asymmetric graphs
– Paul
- 1963
|
|
1
|
Distributed computational complexities: are you Volvo-addicted or NASCAR-obsessed
– Pierre Fraigniaud
- 2010
|
|
2
|
Local distributed decision
– P Fraigniaud, A Korman, D Peleg
|
|
1
|
Locally checkable proofs. http://www.iki.fi/jukka.suomela/lcp
– Mika Göös, Jukka Suomela
- 2011
|
|
1
|
Yoav Rodeh. Constructing labeling schemes through universal matrices
– Amos Korman, David Peleg
|
|
12
|
Distributed Verification of Minimum Spanning Trees
– Amos Korman, Shay Kutten
- 2006
|
|
60
|
Cycles of even length in graphs
– A Bondy, M Simonovits
- 1974
|
|
232
|
Descriptive complexity
– Neil Immerman
- 1998
|
|
171
|
Local and global properties in networks of processors (Extended Abstract
– Dana Angluin
- 1980
|
|
59
|
Compact and Localized Distributed Data Structures
– Cyril Gavoille, David Peleg
- 2001
|
|
211
|
Distributed Computing: A Locality-Sensitive Approach
– D Peleg
- 2000
|
|
242
|
Generalized first-order spectra and polynomial-time recognizable sets
– R Fagin
- 1974
|
|
93
|
What Can Be Computed Locally?
– Moni Naor, Larry Stockmeyer
- 1993
|
|
69
|
Reachability is harder for directed than for undirected finite graphs
– Miklos Ajtai, Ronald Fagin
- 1990
|
