Local mending
From MaRDI portal
Publication:2097329
Cites work
- A lower bound for the distributed Lovász local lemma
- A time hierarchy theorem for the LOCAL model
- Brief announcement: An exponential separation between randomized and deterministic complexity in the LOCAL model
- Constructing labeling schemes through universal matrices
- Deterministic (+1)-coloring in sublinear (in ) time in static, dynamic, and faulty networks
- Distributed coloring in sparse graphs with fewer colors
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Distributed graph problems through an automata-theoretic Lens
- Distributed verification of minimum spanning trees
- Fast distributed network decompositions and covers
- Fault-containing self-stabilizing distributed protocols
- Fault-Local Distributed Mending
- Finitary coloring
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 6850477 (Why is no real title available?)
- LCL problems on grids
- Local mending
- Local stabilizer
- Locality in Distributed Graph Algorithms
- Locality of not-so-weak coloring
- Locally checkable proofs
- New classes of distributed time complexity
- Optimal distributed coloring algorithms for planar graphs in the LOCAL model
- Proof labeling schemes
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- The local nature of list colorings for graphs of high girth
- The State of the Art in Dynamic Graph Algorithms
- Tight Fault Locality
- Total domination in graphs
- What Can be Computed Locally?
This page was built for publication: Local mending
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097329)
