Brief announcement: Local advice and local decompression
From MaRDI portal
Cites work
- A lower bound for the distributed Lovász local lemma
- A time hierarchy theorem for the LOCAL model
- Almost global problems in the LOCAL model
- An exponential separation between randomized and deterministic complexity in the LOCAL model
- Brief announcement: Local advice and local decompression
- Communication algorithms with advice
- Constructing labeling schemes through universal matrices
- Deterministic graph exploration with advice
- Distributed computing with advice: information sensitivity of graph coloring
- Distributed degree splitting, edge coloring, and orientations
- Distributed verification of minimum spanning trees
- Drawing maps with advice
- Fast radio broadcasting with advice
- Fast rendezvous with advice
- Graph searching with advice
- How much does randomness help with locally checkable problems?
- Improved distributed degree splitting and edge coloring
- Linial for lists
- Local conflict coloring
- Locality in Distributed Graph Algorithms
- Locally checkable labelings with small messages
- Locally checkable proofs in distributed computing
- Locally-iterative Distributed (Δ + 1)-coloring and Applications
- New classes of distributed time complexity
- On derandomizing local distributed algorithms
- Online graph exploration with advice
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Proof labeling schemes
- Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy
- Time vs. information tradeoffs for leader election in anonymous trees
- Topology recognition with advice
- Trade-offs between the size of advice and broadcasting time in trees
- Treasure hunt with advice
- Tree exploration with advice
- What Can be Computed Locally?
Cited in
(3)
This page was built for publication: Brief announcement: Local advice and local decompression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971972)
