Title |
|---|
 Completing the Node-Averaged Complexity Landscape of LCLs on TreesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2024 |
 The Distributed Complexity of Locally Checkable Labeling Problems Beyond
Paths and TreesInformation Technology Convergence and Services (ITCS), 2023 |
 On the Node-Averaged Complexity of Locally Checkable Problems on TreesInternational Symposium on Distributed Computing (DISC), 2023 |
 Optimal Deterministic Massively Parallel Connectivity on ForestsACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Exponential Speedup Over Locality in MPC with Optimal MemoryInternational Symposium on Distributed Computing (DISC), 2022 |
 Efficient Classification of Locally Checkable Problems in Regular TreesInternational Symposium on Distributed Computing (DISC), 2022 |
 The Landscape of Distributed Complexities on Trees and BeyondACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Sinkless Orientation Made SimpleSIAM Symposium on Simplicity in Algorithms (SSA), 2021 |
 Efficient CONGEST Algorithms for the Lovasz Local LemmaInternational Symposium on Distributed Computing (DISC), 2021 |
 Local Problems on Trees from the Perspectives of Distributed Algorithms,
Finitary Factors, and Descriptive CombinatoricsInformation Technology Convergence and Services (ITCS), 2021 |
 Locally Checkable Labelings with Small MessagesInternational Symposium on Distributed Computing (DISC), 2021 |
 Locally Checkable Problems in Rooted TreesDistributed computing (Distrib. Comput.), 2021 |
 Local MendingColloquium on Structural Information & Communication Complexity (SIROCCO), 2021 |
 The Complexity Landscape of Distributed Locally Checkable Problems on
TreesInternational Symposium on Distributed Computing (DISC), 2020 |
 Distributed graph problems through an automata-theoretic lensColloquium on Structural Information & Communication Complexity (SIROCCO), 2020 |
 A Breezing Proof of the KMW BoundSIAM Symposium on Simplicity in Algorithms (SOSA), 2020 |
 Classification of distributed binary labeling problemsInternational Symposium on Distributed Computing (DISC), 2019 |
 Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph ProblemsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2019 |
 An Automatic Speedup Theorem for Distributed ProblemsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2019 |
