Cited in
(22)- Stabilizing time-adaptive protocols
- On chromatic sums and distributed resource allocation
- The local detection paradigm and its applications to self-stabilization
- A fast network-decomposition algorithm and its applications to constant-time distributed computation
- Impact of locality on location aware unit disk graphs
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs
- Improved distributed degree splitting and edge coloring
- Proof labeling schemes
- Distributed computing with advice: information sensitivity of graph coloring
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (extended abstract)
- Checking Global Graph Properties by Means of Local Computations: the Majority Problem
- Neighborhood graphs and distributed Δ+1-coloring
- What can be computed in a distributed system?
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
- Local approximation of the maximum cut in regular graphs
- Distributed distance-r covering problems on sparse high-girth graphs
- Distributed distance-\(r\) covering problems on sparse high-girth graphs
- Local MST computation with short advice
- Exact distributed sampling
- Brief Announcement: Local Problems in the SUPPORTED Model
- Self-stabilizing ( +1)-coloring in sublinear (in ) rounds via locally-iterative algorithms
- Locally-iterative (+1)-coloring in sublinear (in ) rounds
This page was built for publication: What can be computed locally?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248485)
