Martín Costa
@martincosta.bsky.social
Theoretical Computer Science | University of Warwick | Google PhD Fellowship in Algorithms and Theory
Reposted by Martín Costa
Sepehr Assadi and his collaborators have won a STOC 2025 Best Paper Award! Their result is a near optimal solution to a foundational problem in graph theory: A randomized algorithm that computes a (∆ + 1)-edge colouring in only O(m log ∆) time, with high probability.
cs.uwaterloo.ca/news/sepehr-...
cs.uwaterloo.ca/news/sepehr-...
May 12, 2025 at 5:58 PM
Sepehr Assadi and his collaborators have won a STOC 2025 Best Paper Award! Their result is a near optimal solution to a foundational problem in graph theory: A randomized algorithm that computes a (∆ + 1)-edge colouring in only O(m log ∆) time, with high probability.
cs.uwaterloo.ca/news/sepehr-...
cs.uwaterloo.ca/news/sepehr-...