Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On the distributed complexity of computing maximal matchings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal Distributed Arc-Consistency
Constraints
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Distributed Soft Path Coloring
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Efficient multi-word locking using randomization
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A local algorithm for finding dense subgraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A Limit to the Power of Multiple Nucleation in Self-assembly
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Tight Local Approximation Results for Max-Min Linear Programs
Algorithmic Aspects of Wireless Sensor Networks
Link Scheduling in Local Interference Models
Algorithmic Aspects of Wireless Sensor Networks
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
Theoretical Computer Science
A simple local 3-approximation algorithm for vertex cover
Information Processing Letters
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
An optimal local approximation algorithm for max-min linear programs
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Local edge colouring of Yao-like subgraphs of unit disk graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Local computation of PageRank contributions
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Local approximation algorithms for scheduling problems in sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A local 2-approximation algorithm for the vertex cover problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
What can be observed locally? round-based models for quantum distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A local algorithm for finding dense subgraphs
ACM Transactions on Algorithms (TALG)
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Analysing local algorithms in location-aware quasi-unit-disk graphs
Discrete Applied Mathematics
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed graph pattern matching
Proceedings of the 21st international conference on World Wide Web
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Brief announcement: what can be computed without communication?
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Lower bounds for local approximation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Deterministic local algorithms, unique identifiers, and fractional graph colouring
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
What can be computed without communications?
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
No sublogarithmic-time approximation scheme for bipartite vertex cover
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
ACM Computing Surveys (CSUR)
What can be decided locally without identifiers?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Exploiting locality in distributed SDN control
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Lower bounds for local approximation
Journal of the ACM (JACM)
| Hi-index | 0.00 |
The purpose of this paper is a study of computation that can be done locally in a distributed network, where "locally" means within time (or distance) independent of the size of the network. Locally checkable labeling (LCL) problems are considered, where the legality of a labeling can be checked locally (e.g., coloring). The results include the following: There are nontrivial LCL problems that have local algorithms. There is a variant of the dining philosophers problem that can be solved locally. Randomization cannot make an LCL problem local; i.e., if a problem has a local randomized algorithm then it has a local deterministic algorithm. It is undecidable, in general, whether a given LCL has a local algorithm. However, it is decidable whether a given LCL has an algorithm that operates in a given time $t$. Any LCL problem that has a local algorithm has one that is order-invariant (the algorithm depends only on the order of the processor IDs).