ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2009.06043
  4. Cited By
Simple, Deterministic, Constant-Round Coloring in the Congested Clique

Simple, Deterministic, Constant-Round Coloring in the Congested Clique

13 September 2020
A. Czumaj
Peter Davies
M. Parter
ArXiv (abs)PDFHTML

Papers citing "Simple, Deterministic, Constant-Round Coloring in the Congested Clique"

15 / 15 papers shown
Title
Sublinear-time Sampling of Spanning Trees in the Congested Clique
Sublinear-time Sampling of Spanning Trees in the Congested Clique
Sriram V. Pemmaraju
Sourya Roy
Joshua Sobel
69
0
0
20 Nov 2024
Massively Parallel Ruling Set Made Deterministic
Massively Parallel Ruling Set Made Deterministic
Jeff Giliberti
Zahra Parsaeian
78
4
0
18 Jun 2024
Recognizing Hereditary Properties in the Presence of Byzantine Nodes
Recognizing Hereditary Properties in the Presence of Byzantine Nodes
David Cifuentes-Núnez
Pedro Montealegre
I. Rapaport
39
1
0
12 Dec 2023
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set
  Problem
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem
Mélanie Cambus
Fabian Kuhn
Shreyas Pai
Jara Uitto
55
10
0
01 Jun 2023
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
Manuela Fischer
Jeff Giliberti
Christoph Grunau
58
5
0
26 Jan 2023
Improved Deterministic Connectivity in Massively Parallel Computation
Improved Deterministic Connectivity in Massively Parallel Computation
Manuela Fischer
Jeff Giliberti
Christoph Grunau
58
5
0
03 Jun 2022
Overcoming Congestion in Distributed Coloring
Overcoming Congestion in Distributed Coloring
Magnús M. Halldórsson
Alexandre Nolin
Tigran Tonoyan
35
16
0
28 May 2022
Deterministic Massively Parallel Algorithms for Ruling Sets
Deterministic Massively Parallel Algorithms for Ruling Sets
Shreyas Pai
Sriram V. Pemmaraju
134
2
0
25 May 2022
Improved Deterministic $(Δ+1)$-Coloring in Low-Space MPC
Improved Deterministic (Δ+1)(Δ+1)(Δ+1)-Coloring in Low-Space MPC
A. Czumaj
Peter Davies
M. Parter
45
21
0
10 Dec 2021
Near-Optimal Distributed Degree+1 Coloring
Near-Optimal Distributed Degree+1 Coloring
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
Tigran Tonoyan
50
39
0
01 Dec 2021
Deterministic Massively Parallel Connectivity
Deterministic Massively Parallel Connectivity
Samantha R. Coy
A. Czumaj
73
18
0
09 Aug 2021
Component Stability in Low-Space Massively Parallel Computation
Component Stability in Low-Space Massively Parallel Computation
A. Czumaj
Peter Davies
M. Parter
48
24
0
03 Jun 2021
Can We Break Symmetry with o(m) Communication?
Can We Break Symmetry with o(m) Communication?
Shreyas Pai
Gopal Pandurangan
Sriram V. Pemmaraju
Peter Robinson
LRM
65
9
0
19 May 2021
Near-Optimal Scheduling in the Congested Clique
Near-Optimal Scheduling in the Congested Clique
K. Censor-Hillel
Yannic Maus
Volodymyr Polosukhin
25
1
0
14 Feb 2021
Graph Sparsification for Derandomizing Massively Parallel Computation
  with Low Space
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
A. Czumaj
Peter Davies
M. Parter
64
29
0
11 Dec 2019
1