 Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic
Energy CostACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2024 |
 On the Node-Averaged Complexity of Locally Checkable Problems on TreesInternational Symposium on Distributed Computing (DISC), 2023 |
 Average Awake Complexity of MIS and MatchingACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022 |
 Node and Edge Averaged Complexities of Local Graph ProblemsDistributed computing (Distrib. Comput.), 2022 |
 |
 Deterministic Logarithmic Completeness in the Distributed Sleeping ModelInternational Symposium on Distributed Computing (DISC), 2021 |
 Sleeping is Efficient: MIS in -rounds Node-averaged Awake
ComplexityACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
