ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2007.15251
  4. Cited By
Local Conflict Coloring Revisited: Linial for Lists

Local Conflict Coloring Revisited: Linial for Lists

International Symposium on Distributed Computing (DISC), 2020
30 July 2020
Yannic Maus
Tigran Tonoyan
ArXiv (abs)PDFHTML

Papers citing "Local Conflict Coloring Revisited: Linial for Lists"

16 / 16 papers shown
Title
Distributed Lovász Local Lemma under Bandwidth Limitations
Distributed Lovász Local Lemma under Bandwidth Limitations
Magnús M. Halldórsson
Yannic Maus
Saku Peltonen
117
4
0
12 May 2024
Simpler and More General Distributed Coloring Based on Simple List
  Defective Coloring Algorithms
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
Marc Fuchs
Fabian Kuhn
176
1
0
07 May 2024
Tight Lower Bounds in the Supported LOCAL Model
Tight Lower Bounds in the Supported LOCAL Model
Alkida Balliu
Thomas Boudier
Sebastian Brandt
Dennis Olivetti
125
3
0
01 May 2024
A Distributed Palette Sparsification Theorem
A Distributed Palette Sparsification TheoremACM-SIAM Symposium on Discrete Algorithms (SODA), 2023
Maxime Flin
M. Ghaffari
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
MoE
288
8
0
16 Jan 2023
Recurrent Problems in the LOCAL model
Recurrent Problems in the LOCAL model
A. Agrawal
John E. Augustine
David Peleg
Srikkanth Ramachandran
84
1
0
30 Dec 2022
Fast Distributed Brooks' Theorem
Fast Distributed Brooks' TheoremACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
Manuela Fischer
Yannic Maus
Magnús M. Halldórsson
OOD
111
21
0
14 Nov 2022
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
Distributed Maximal Matching and Maximal Independent Set on HypergraphsACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
187
15
0
03 Nov 2022
Fast Distributed Vertex Splitting with Applications
Fast Distributed Vertex Splitting with ApplicationsInternational Symposium on Distributed Computing (DISC), 2022
Magnús M. Halldórsson
Yannic Maus
Alexandre Nolin
144
8
0
17 Aug 2022
Distributed Edge Coloring in Time Polylogarithmic in $Δ$
Distributed Edge Coloring in Time Polylogarithmic in ΔΔΔACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
134
22
0
02 Jun 2022
Efficient Classification of Locally Checkable Problems in Regular Trees
Efficient Classification of Locally Checkable Problems in Regular TreesInternational Symposium on Distributed Computing (DISC), 2022
Alkida Balliu
S. Brandt
Yi-Jun Chang
Dennis Olivetti
Jan Studený
Jukka Suomela
130
11
0
17 Feb 2022
Improved Distributed Fractional Coloring Algorithms
Improved Distributed Fractional Coloring Algorithms
Alkida Balliu
Fabian Kuhn
Dennis Olivetti
186
5
0
08 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
140
43
0
01 Dec 2021
Distributed $Δ$-Coloring Plays Hide-and-Seek
Distributed ΔΔΔ-Coloring Plays Hide-and-Seek
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
180
34
0
01 Oct 2021
Distributed Graph Coloring Made Easy
Distributed Graph Coloring Made EasyACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021
Yannic Maus
194
26
0
12 May 2021
Ultrafast Distributed Coloring of High Degree Graphs
Ultrafast Distributed Coloring of High Degree Graphs
Magnús M. Halldórsson
Alexandre Nolin
Tigran Tonoyan
140
7
0
10 May 2021
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without
  Network Decomposition
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition
M. Ghaffari
Fabian Kuhn
230
70
0
09 Nov 2020
1