An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q115525618 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally-Iterative Distributed (Δ+ 1) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number, girth and maximal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / 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: Q4608064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal distributed (Δ+1)-coloring algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for the Lovász local lemma and graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs of large girth and arbitrary degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / 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: Distributed (Δ +1)-Coloring in Sublogarithmic Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Byzantine agreement in polynomial expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward more localized local algorithms: removing assumptions concerning global knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Fast 3-Ruling Sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple distributed algorithms for sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Distributed Network Decomposition / 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: An optimal maximal independent set algorithm for bounded-independence graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved deterministic distributed matching via rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/17m1117537 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2913663107 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:03, 4 December 2024

scientific article; zbMATH DE number 7015673
Language Label Description Also known as
English
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
scientific article; zbMATH DE number 7015673

    Statements

    An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    coloring
    0 references
    distributed algorithm
    0 references
    local model
    0 references
    symmetry breaking
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references