 Improved All-Pairs Approximate Shortest Paths in Congested CliqueACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2024 |
 Deterministic Near-Optimal Distributed Listing of CliquesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Distributed Subgraph Finding: Progress and ChallengesInternational Colloquium on Automata, Languages and Programming (ICALP), 2022 |
 Sparse Matrix Multiplication in the Low-Bandwidth ModelACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022 |
 Fast Distributed Algorithms for Girth, Cycles and Small SubgraphsInternational Symposium on Distributed Computing (DISC), 2021 |
 On Distributed Listing of CliquesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Exponentially Faster Shortest Paths in the Congested CliqueACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
