 Fast Coloring Despite Congested RelaysInternational Symposium on Distributed Computing (DISC), 2023 |
 Average Awake Complexity of MIS and MatchingACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022 |
 A Simple Deterministic Distributed Low-Diameter ClusteringSIAM Symposium on Simplicity in Algorithms (SOSA), 2022 |
 Efficient CONGEST Algorithms for the Lovasz Local LemmaInternational Symposium on Distributed Computing (DISC), 2021 |
 Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree
Dominating Sets in TreesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Coloring Fast Without Learning Your Neighbors' ColorsInternational Symposium on Distributed Computing (DISC), 2020 |
 Improved Deterministic Network DecompositionACM-SIAM Symposium on Discrete Algorithms (SODA), 2020 |
 Distributed Lower Bounds for Ruling SetsIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020 |
