Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(7 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Spark / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MapReduce / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hadoop / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Dryad / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Deterministic Distributed Coloring with Small Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed symmetry-breaking algorithms for congested cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing local distributed algorithms under bandwidth restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal distributed (Δ+1)-coloring algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication-Efficient Parallel Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, Searching, and Simulation in the MapReduce Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Derandomization Scheme and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal deterministic routing and sorting on the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Delta+1) Coloring in the Congested Clique Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/20m1366502 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3209631018 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:41, 30 July 2024

scientific article; zbMATH DE number 7430750
Language Label Description Also known as
English
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
scientific article; zbMATH DE number 7430750

    Statements

    Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2021
    0 references
    congested clique
    0 references
    massively parallel computation
    0 references
    coloring
    0 references
    derandomization
    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