Distributed graph problems through an automata-theoretic Lens
From MaRDI portal
Publication:2117706
Cites work
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- scientific article; zbMATH DE number 2213327 (Why is no real title available?)
- 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: Classification of Distributed Binary Labeling Problems
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Deterministic coin tossing with applications to optimal parallel list ranking
- Directable nondeterministic automata
- Distributed Computing: A Locality-Sensitive Approach
- Distributed coloring algorithms for triangle-free graphs
- Distributed degree splitting, edge coloring, and orientations
- How much does randomness help with locally checkable problems?
- Improved upper bounds on synchronizing nondeterministic automata
- LCL problems on grids
- Locality in Distributed Graph Algorithms
- New classes of distributed time complexity
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Reset Sequences for Monotonic Automata
- Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy
- Synchronizing non-deterministic finite automata
- The Distributed Complexity of Locally Checkable Problems on Paths is Decidable
- The locality of distributed symmetry breaking
- What Can be Computed Locally?
Cited in
(3)
This page was built for publication: Distributed graph problems through an automata-theoretic Lens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117706)
