What Can be Computed Locally?
Abstract
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).
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Leonard Adleman, Two theorems on random polynomial time19th Annual Symposium on Foundations of Computer Science (Ann Arbor, Mich., 1978), IEEE, Long Beach, Calif., 1978, 75–83
2.
Y. Afek, S. Kutten, M. Yung, Local detection for global self stabilization, 1991, manuscript; a preliminary version appeared in Proc. 4th Workshop on Distributed Algorithms, Lecture Notes in Computer Science, 486, Springer-Verlag, New York, pp. 15–28
3.
B. Awerbuch, A. V. Goldberg, M. Luby, S. A. Plotkin, Network decomposition and locality in distributed computation, Proc. 30th IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, 364–369
4.
K. M. Chandy, J. Misra, The drinking philosophers problem, ACM Trans. Programming Languages and Systems, 6 (1984), 632–646
5.
M. Choy, A. K. Singh, Efficient fault tolerant algorithms for resource allocation in distributed systems, Proc. 24th ACM Symposium on Theory of Computing, 1992, 593–602
6.
Richard Cole, Uzi Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Inform. and Control, 70 (1986), 32–53
7.
Greg N. Frederickson, Nancy A. Lynch, Electing a leader in a synchronous ring, J. Assoc. Comput. Mach., 34 (1987), 98–115
8.
Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon, Parallel symmetry-breaking in sparse graphs, SIAM J. Discrete Math., 1 (1988), 434–446
9.
Ronald L. Graham, Bruce L. Rothschild, Joel H. Spencer, Ramsey theory, John Wiley & Sons Inc., New York, 1980ix+174
10.
Nathan Linial, Locality in distributed graph algorithms, SIAM J. Comput., 21 (1992), 193–201
11.
Nancy A. Lynch, Upper bounds for static resource allocation in a distributed system, J. Comput. System Sci., 23 (1981), 254–278
12.
A. Mayer, M. Naor, L. Stockmeyer, Local computations on static and dynamic graphs, Proc. 3rd Israel Symposium on Theory of Computing and Systems, Tel Aviv, Israel, 1995, 268–278
13.
Shlomo Moran, Marc Snir, Udi Manber, Applications of Ramsey's theorem to decision tree complexity, J. Assoc. Comput. Mach., 32 (1985), 938–949
14.
Moni Naor, A lower bound on probabilistic algorithms for distributive ring coloring, SIAM J. Discrete Math., 4 (1991), 409–412
15.
A. Panconesi, A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems, Proc. 24th ACM Symposium on Theory of Computing, Victoria, BC, Canada, 1992, 581–592
16.
F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc., (2), 30 (1930), 264–286
17.
E. Styer, G. L. Peterson, Improved algorithms for distributed resource allocation, Proc. 7th ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 1988, 105–116
18.
Andrew Chih Yao, Should tables be sorted?, J. Assoc. Comput. Mach., 28 (1981), 615–628
Information & Authors
Information
Published In
SIAM Journal on Computing
Pages: 1259 - 1277
ISSN (online): 1095-7111
Copyright
Copyright © 1995 Society for Industrial and Applied Mathematics.
History
Submitted: 27 August 1993
Accepted: 28 June 1994
Published online: 13 July 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
-
Component stability in low-space massively parallel computation Distributed Computing, Vol. 37, No. 1 | 8 February 2024
-
Distributed half-integral matching and beyond Theoretical Computer Science, Vol. 982 | 1 Jan 2024
-
Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics Advances in Mathematics, Vol. 431 | 1 Oct 2023
-
Locally checkable problems in rooted trees Distributed Computing, Vol. 36, No. 3 | 22 August 2022
-
A lower bound for constant-size local certification Theoretical Computer Science, Vol. 971 | 1 Sep 2023
-
Distributed algorithms, the Lovász Local Lemma, and descriptive combinatorics Inventiones mathematicae, Vol. 22 | 19 April 2023
-
Local certification of graphs with bounded genus Discrete Applied Mathematics, Vol. 325 | 1 Jan 2023
-
Distributed graph problems through an automata-theoretic lens Theoretical Computer Science | 1 Jan 2023
-
Planarity can be verified by an approximate proof labeling scheme in constant-time Journal of Combinatorial Theory, Series A, Vol. 191 | 1 Oct 2022
-
Error-sensitive proof-labeling schemes Journal of Parallel and Distributed Computing, Vol. 166 | 1 Aug 2022
-
Distributed Lower Bounds for Ruling Sets SIAM Journal on Computing, Vol. 51, No. 1 | 8 February 2022
-
Local Mending Structural Information and Communication Complexity | 25 June 2022
-
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes Structural Information and Communication Complexity | 25 June 2022
-
Lower Bound for Constant-Size Local Certification Stabilization, Safety, and Security of Distributed Systems | 9 November 2022
-
On the power of randomization in distributed algorithms in dynamic networks with adaptive adversaries Journal of Parallel and Distributed Computing, Vol. 159 | 1 Jan 2022
-
Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings ACM Transactions on Parallel Computing, Vol. 8, No. 4 | 15 October 2021
-
Almost global problems in the LOCAL model Distributed Computing, Vol. 34, No. 4 | 18 April 2020
-
Component Stability in Low-Space Massively Parallel Computation Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 23 July 2021
-
Locally Checkable Problems in Rooted Trees Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 23 July 2021
-
Efficient Load-Balancing through Distributed Token Dropping Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures | 6 July 2021
-
A self‐stabilizing distributed algorithm for the local (1 , |Ni|) ‐critical section problem Concurrency and Computation: Practice and Experience, Vol. 33, No. 12 | 23 December 2019
-
A hierarchy of local decision Theoretical Computer Science, Vol. 856 | 1 Feb 2021
-
Distributed Graph Problems Through an Automata-Theoretic Lens Structural Information and Communication Complexity | 20 June 2021
-
Reactive Pls for Distributed Decision SSRN Electronic Journal, Vol. 62 | 1 Jan 2021
-
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs Stabilization, Safety, and Security of Distributed Systems | 9 November 2021
-
The power of locality: Exploring the limits of randomness in distributed computing it - Information Technology, Vol. 62, No. 5-6 | 21 January 2020
-
Fooling views: a new lower bound technique for distributed computations under congestion Distributed Computing, Vol. 33, No. 6 | 9 April 2020
-
Distributed Lower Bounds for Ruling Sets 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
-
Brief Announcement: Classification of Distributed Binary Labeling Problems Proceedings of the 39th Symposium on Principles of Distributed Computing | 31 July 2020
-
How much does randomness help with locally checkable problems? Proceedings of the 39th Symposium on Principles of Distributed Computing | 31 July 2020
-
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Proceedings of the 39th Symposium on Principles of Distributed Computing | 31 July 2020
-
Polylogarithmic-time deterministic network decomposition and distributed derandomization Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 6 June 2020
-
What can be sampled locally? Distributed Computing, Vol. 33, No. 3-4 | 27 April 2018
-
Derandomizing local distributed algorithms under bandwidth restrictions Distributed Computing, Vol. 33, No. 3-4 | 18 April 2020
-
Ant collective cognition allows for efficient navigation through disordered environments eLife, Vol. 9 | 12 May 2020
-
Deciding and verifying network properties locally with few output bits Distributed Computing, Vol. 33, No. 2 | 13 June 2019
-
Local Algorithms for Sparse Spanning Graphs Algorithmica, Vol. 82, No. 4 | 3 August 2019
-
How long it takes for an ordinary node with an ordinary id to output? Theoretical Computer Science, Vol. 811 | 1 Apr 2020
-
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma ACM Transactions on Algorithms, Vol. 16, No. 1 | 15 November 2019
-
The Impact of Locality in the Broadcast Congested Clique Model SIAM Journal on Discrete Mathematics, Vol. 34, No. 1 | 12 March 2020
-
Network Decomposition and Distributed Derandomization (Invited Paper) Structural Information and Communication Complexity | 28 July 2020
-
On the Power of Randomization in Distributed Algorithms in Dynamic Networks with Adaptive Adversaries Euro-Par 2020: Parallel Processing | 18 August 2020
-
Invited Paper: Reactive PLS for Distributed Decision Stabilization, Safety, and Security of Distributed Systems | 25 November 2020
-
Distributed assignment with limited communication for multi-robot multi-target tracking Autonomous Robots, Vol. 44, No. 1 | 17 May 2019
-
Distributed Detection of Cycles ACM Transactions on Parallel Computing, Vol. 6, No. 3 | 15 October 2019
-
Hardness of Minimal Symmetry Breaking in Distributed Computing Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 16 July 2019
-
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 16 July 2019
-
On the Use of Randomness in Local Distributed Graph Algorithms Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 16 July 2019
-
On the Complexity of Distributed Splitting Problems Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 16 July 2019
-
On the Power of Preprocessing in Decentralized Network Optimization IEEE INFOCOM 2019 - IEEE Conference on Computer Communications | 1 Apr 2019
-
Making Local Algorithms Wait-Free: the Case of Ring Coloring Theory of Computing Systems, Vol. 63, No. 2 | 4 May 2017
-
An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems Journal of Computational Physics, Vol. 379 | 1 Feb 2019
-
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model SIAM Journal on Computing, Vol. 48, No. 1 | 30 January 2019
-
A Time Hierarchy Theorem for the LOCAL Model SIAM Journal on Computing, Vol. 48, No. 1 | 3 January 2019
-
Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model Stabilization, Safety, and Security of Distributed Systems | 14 November 2019
-
Localisation-Resistant Random Words with Small Alphabets Combinatorics on Words | 9 August 2019
-
Locality of Not-so-Weak Coloring Structural Information and Communication Complexity | 13 July 2019
-
On Distributed Merlin-Arthur Decision Protocols Structural Information and Communication Complexity | 13 July 2019
-
Identifiers in Registers Foundations of Software Science and Computation Structures | 5 April 2019
-
A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem Theoretical Computer Science, Vol. 753 | 1 Jan 2019
-
The balance of autonomous and centralized control in scheduling problems Applied Network Science, Vol. 3, No. 1 | 9 July 2018
-
Node labels in local decision Theoretical Computer Science, Vol. 751 | 1 Dec 2018
-
Self-Stabilizing Algorithm for Dynamically Maintaining Two Disjoint Dominating Sets 2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) | 1 Nov 2018
-
What can be verified locally? Journal of Computer and System Sciences, Vol. 97 | 1 Nov 2018
-
A Classification of Locality in Network Research ACM Computing Surveys, Vol. 50, No. 4 | 31 Jul 2018
-
On Local Distributed Sampling and Counting Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 23 July 2018
-
Towards a Complexity Theory for the Congested Clique Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures | 11 July 2018
-
New classes of distributed time complexity Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 20 June 2018
-
On mobile agent verifiable problems Information and Computation, Vol. 260 | 1 Jun 2018
-
Constant-Time Local Computation Algorithms Theory of Computing Systems, Vol. 62, No. 2 | 20 June 2017
-
Computing large independent sets in a single round Distributed Computing, Vol. 31, No. 1 | 24 March 2017
-
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model LATIN 2018: Theoretical Informatics | 13 March 2018
-
Decidability classes for mobile agents computing Journal of Parallel and Distributed Computing, Vol. 109 | 1 Nov 2017
-
Linear-in- $$\varDelta $$ Δ lower bounds in the LOCAL model Distributed Computing, Vol. 30, No. 5 | 19 May 2015
-
A Time Hierarchy Theorem for the LOCAL Model 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2017
-
LCL Problems on Grids Proceedings of the ACM Symposium on Principles of Distributed Computing | 25 July 2017
-
Distributed Detection of Cycles Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures | 24 July 2017
-
On the complexity of local distributed graph problems Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 19 June 2017
-
Constructing near spanning trees with few local inspections Random Structures & Algorithms, Vol. 50, No. 2 | 4 April 2016
-
A systematic approach to constructing incremental topology control algorithms using graph transformation Journal of Visual Languages & Computing, Vol. 38 | 1 Feb 2017
-
How Long It Takes for an Ordinary Node with an Ordinary ID to Output? Structural Information and Communication Complexity | 30 December 2017
-
Can We Locally Compute Sparse Connected Subgraphs? Computer Science – Theory and Applications | 6 May 2017
-
New techniques and tighter bounds for local computation algorithms Journal of Computer and System Sciences, Vol. 82, No. 7 | 1 Nov 2016
-
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2016
-
Local Conflict Coloring 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2016
-
Brief Announcement Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 25 July 2016
-
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures | 11 July 2016
-
A lower bound for the distributed Lovász local lemma Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 19 June 2016
-
A Look at Basics of Distributed Computing 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS) | 1 Jun 2016
-
Local Computation Journal of the ACM, Vol. 63, No. 2 | 31 March 2016
-
Synchronous counting and computational algorithm design Journal of Computer and System Sciences, Vol. 82, No. 2 | 1 Mar 2016
-
Locality in Distributed Graph Algorithms Encyclopedia of Algorithms | 22 April 2016
-
Making Local Algorithms Wait-Free: The Case of Ring Coloring Stabilization, Safety, and Security of Distributed Systems | 3 November 2016
-
Non-local Probes Do Not Help with Many Graph Problems Distributed Computing | 4 September 2016
-
Deterministic local algorithms, unique identifiers, and fractional graph colouring Theoretical Computer Science, Vol. 610 | 1 Jan 2016
-
Ramanujan graphings and correlation decay in local algorithms Random Structures & Algorithms, Vol. 47, No. 3 | 1 July 2014
-
A local approximation algorithm for minimum dominating set problem in anonymous planar networks Distributed Computing, Vol. 28, No. 5 | 24 June 2015
-
Finding Hidden Cliques of Size $$\sqrt{N/e}$$ N / e in Nearly Linear Time Foundations of Computational Mathematics, Vol. 15, No. 4 | 9 September 2014
-
A (Truly) Local Broadcast Layer for Unreliable Radio Networks Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 21 July 2015
-
Randomized Local Network Computing Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures | 13 June 2015
-
Allowing each node to communicate only once in a distributed system: shared whiteboard models Distributed Computing, Vol. 28, No. 3 | 4 June 2014
-
Weak models of distributed computing, with connections to modal logic Distributed Computing, Vol. 28, No. 1 | 1 January 2014
-
Node Labels in Local Decision Structural Information and Communication Complexity | 20 November 2015
-
Exact Bounds for Distributed Graph Colouring Structural Information and Communication Complexity | 20 November 2015
-
Locality in Distributed Graph Algorithms Encyclopedia of Algorithms | 18 April 2015
-
Randomness vs. Time in Anonymous Networks Distributed Computing | 5 November 2015
-
Distributed Large Independent Sets in One Round on Bounded-Independence Graphs Distributed Computing | 5 November 2015
-
No sublogarithmic-time approximation scheme for bipartite vertex cover Distributed Computing, Vol. 27, No. 6 | 17 September 2013
-
Randomized distributed decision Distributed Computing, Vol. 27, No. 6 | 6 April 2014
-
What can be computed without communications? ACM SIGACT News, Vol. 45, No. 3 | 17 September 2014
-
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs Automata, Languages, and Programming | 1 Jan 2014
-
Distributedly Testing Cycle-Freeness Graph-Theoretic Concepts in Computer Science | 21 October 2014
-
Toward more localized local algorithms: removing assumptions concerning global knowledge Distributed Computing, Vol. 26, No. 5-6 | 14 September 2012
-
Towards a complexity theory for local distributed computing Journal of the ACM, Vol. 60, No. 5 | 28 October 2013
-
Lower bounds for local approximation Journal of the ACM, Vol. 60, No. 5 | 28 October 2013
-
Locality and checkability in wait-free computing Distributed Computing, Vol. 26, No. 4 | 7 June 2013
-
Survey of local algorithms ACM Computing Surveys, Vol. 45, No. 2 | 12 March 2013
-
Local Decision and Verification with Bounded-Size Outputs Stabilization, Safety, and Security of Distributed Systems | 1 Jan 2013
-
Distributed graph pattern matching Proceedings of the 21st international conference on World Wide Web | 16 April 2012
-
Decidability Classes for Mobile Agents Computing LATIN 2012: Theoretical Informatics | 1 Jan 2012
-
What Can Be Computed without Communications? Structural Information and Communication Complexity | 1 Jan 2012
-
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring Structural Information and Communication Complexity | 1 Jan 2012
-
No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover Distributed Computing | 1 Jan 2012
-
Randomized Distributed Decision Distributed Computing | 1 Jan 2012
-
On the Impact of Identifiers on Local Decision Principles of Distributed Systems | 1 Jan 2012
-
Local Approximability of Max-Min and Min-Max Linear Programs Theory of Computing Systems, Vol. 49, No. 4 | 7 December 2010
-
Local Distributed Decision 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
-
Analysing local algorithms in location-aware quasi-unit-disk graphs Discrete Applied Mathematics, Vol. 159, No. 15 | 1 Sep 2011
-
An optimal bit complexity randomized distributed MIS algorithm Distributed Computing, Vol. 23, No. 5-6 | 27 November 2010
-
Locality and Checkability in Wait-Free Computing Distributed Computing | 1 Jan 2011
-
Dynamic slicing of distributed object-oriented programs IET Software, Vol. 5, No. 5 | 1 Jan 2011
-
Distributed Approximation of Capacitated Dominating Sets Theory of Computing Systems, Vol. 47, No. 4 | 2 June 2010
-
Almost Stable Matchings by Truncating the Gale–Shapley Algorithm Algorithmica, Vol. 58, No. 1 | 22 August 2009
-
A local algorithm for finding dense subgraphs ACM Transactions on Algorithms, Vol. 6, No. 4 | 3 September 2010
-
Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) Graph-Theoretic Concepts in Computer Science | 1 Jan 2010
-
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) Structural Information and Communication Complexity | 1 Jan 2010
-
A simple local 3-approximation algorithm for vertex cover Information Processing Letters, Vol. 109, No. 12 | 1 May 2009
-
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs Theoretical Computer Science, Vol. 410, No. 14 | 1 Mar 2009
-
Stateless Distributed Gradient Descent for Positive Linear Programs SIAM Journal on Computing, Vol. 38, No. 6 | 1 April 2009
-
A Local 2-Approximation Algorithm for the Vertex Cover Problem Distributed Computing | 1 Jan 2009
-
What Can Be Observed Locally? Distributed Computing | 1 Jan 2009
-
Local Algorithms: Self-stabilization on Speed Stabilization, Safety, and Security of Distributed Systems | 1 Jan 2009
-
Stateless distributed gradient descent for positive linear programs Proceedings of the fortieth annual ACM symposium on Theory of computing | 17 May 2008
-
Approximating max-min linear programs with local algorithms 2008 IEEE International Symposium on Parallel and Distributed Processing | 1 Apr 2008
-
Tight Local Approximation Results for Max-Min Linear Programs Algorithmic Aspects of Wireless Sensor Networks | 1 Jan 2008
-
Link Scheduling in Local Interference Models Algorithmic Aspects of Wireless Sensor Networks | 1 Jan 2008
-
Distributed verification of minimum spanning trees Distributed Computing, Vol. 20, No. 4 | 15 May 2007
-
Local Computation of PageRank Contributions Algorithms and Models for the Web-Graph | 1 Jan 2007
-
Distributed Soft Path Coloring STACS 2003 | 17 February 2003
-
Representing graphs implicitly using almost optimal space Discrete Applied Mathematics, Vol. 108, No. 1-2 | 1 Feb 2001
-
On the Distributed Complexity of Computing Maximal Matchings SIAM Journal on Discrete Mathematics, Vol. 15, No. 1 | 1 August 2006
-
An Effective Characterization of Computability in Anonymous Networks Distributed Computing | 11 September 2001
-
Sum Multicoloring of Graphs Journal of Algorithms, Vol. 37, No. 2 | 1 Nov 2000
-
Optimal Distributed Arc-Consistency Principles and Practice of Constraint Programming – CP’99 | 1 Jan 1999
-
Compact Implicit Representation of Graphs Graph-Theoretic Concepts in Computer Science | 1 Jan 1998
-
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs Structural Information and Communication Complexity
-
Local Approximation Algorithms for Scheduling Problems in Sensor Networks Algorithmic Aspects of Wireless Sensor Networks
-
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes LATIN 2008: Theoretical Informatics
-
Leveraging Linial’s Locality Limit Distributed Computing
-
A Limit to the Power of Multiple Nucleation in Self-assembly Distributed Computing
-
Local Maps: New Insights into Mobile Agent Algorithms Distributed Computing
View Options
Get Access
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].