Distributed graph problems through an automata-theoretic Lens (Q2117706): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Distributed Complexity of Locally Checkable Problems on Paths is Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement: Classification of Distributed Binary Labeling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost global problems in the LOCAL model / rank
 
Normal rank
Property / cites work
 
Property / cites work: How much does randomness help with locally checkable problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of distributed time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the distributed Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCL Problems on Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Hierarchy Theorem for the LOCAL Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing non-deterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds on synchronizing nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Degree Splitting, Edge Coloring, and Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5696194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed coloring algorithms for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Revision as of 09:33, 28 July 2024

scientific article
Language Label Description Also known as
English
Distributed graph problems through an automata-theoretic Lens
scientific article

    Statements

    Distributed graph problems through an automata-theoretic Lens (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references