 |
 Faster Cycle Detection in the Congested CliqueInternational Symposium on Distributed Computing (DISC), 2024 |
 The Complexity of Distributed Approximation of Packing and Covering
Integer Linear ProgramsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Distributed Quantum Interactive ProofsSymposium on Theoretical Aspects of Computer Science (STACS), 2022 |
 Distributed Merlin-Arthur Synthesis of Quantum States and Its
ApplicationsInternational Symposium on Mathematical Foundations of Computer Science (MFCS), 2022 |
 Quantum Complexity of Weighted Diameter and Radius in CONGEST NetworksACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Deterministic Near-Optimal Distributed Listing of CliquesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Narrowing the LOCALCONGEST Gaps in Sparse Networks via
Expander DecompositionsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Distributed Subgraph Finding: Progress and ChallengesInternational Colloquium on Automata, Languages and Programming (ICALP), 2022 |
 Quantum Distributed Algorithms for Detection of CliquesInformation Technology Convergence and Services (ITCS), 2022 |
 Strong-Diameter Network DecompositionACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Tight Distributed Listing of CliquesACM-SIAM Symposium on Discrete Algorithms (SODA), 2020 |
 Deterministic Distributed Expander Decomposition and Routing with
Applications in Distributed DerandomizationIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020 |
 On Distributed Listing of CliquesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Distributed Quantum Proofs for Replicated DataInformation Technology Convergence and Services (ITCS), 2020 |
