2013
DOI: 10.1145/2499228
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: A central theme in distributed network algorithms concerns understanding and coping with the issue of locality . Yet despite considerable progress, research efforts in this direction have not yet resulted in a solid basis in the form of a fundamental computational complexity theory for locality. Inspired by sequential complexity theory, we focus on a complexity theory for distributed decision problems . In the context of locality, solving a decision problem requi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
165
2
1

Year Published

2014
2014
2020
2020

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 100 publications
(169 citation statements)
references
References 45 publications
1
165
2
1
Order By: Relevance
“…With the objective of providing distributed network computing with a complexity theory based on decision problems, following the guidelines of classical (sequential) complexity theory, [12,13] introduced several decision classes for local computing, and studied the relationships between these classes (which are depending on the number of allowed rounds, on the potential access to oracles, on the potential use of non-determinism and/or of randomization, etc.). Paper [12] generated several following up contributions, including, e.g., studies on the impact of randomization [11], studies on the impact of node identifiers [10], studies on verification tasks where certificates include node IDs [17], etc.…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…With the objective of providing distributed network computing with a complexity theory based on decision problems, following the guidelines of classical (sequential) complexity theory, [12,13] introduced several decision classes for local computing, and studied the relationships between these classes (which are depending on the number of allowed rounds, on the potential access to oracles, on the potential use of non-determinism and/or of randomization, etc.). Paper [12] generated several following up contributions, including, e.g., studies on the impact of randomization [11], studies on the impact of node identifiers [10], studies on verification tasks where certificates include node IDs [17], etc.…”
Section: Related Workmentioning
confidence: 99%
“…An example (borrowed from [13]) of a graph property that can be distributedly tested is: clique-width at most 2. Indeed, a graph has clique-width at most 2 if and only if it is a cograph -see [7].…”
Section: Local Distributed Testingmentioning
confidence: 99%
See 3 more Smart Citations