 Distributed Quantum Advantage for Local ProblemsSymposium on the Theory of Computing (STOC), 2024 |
 Massively Parallel Ruling Set Made DeterministicInternational Symposium on Distributed Computing (DISC), 2024 |
 One Step Forward, One Step Back: FLP-Style Proofs and the
Round-Reduction Technique for Colorless TasksInternational Symposium on Distributed Computing (DISC), 2023 |
 Distributed MIS with Low Energy and Time ComplexitiesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Average Awake Complexity of MIS and MatchingACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022 |
 Speedup of Distributed Algorithms for Power Graphs in the CONGEST ModelInternational Symposium on Distributed Computing (DISC), 2023 |
 Faster Deterministic Distributed MIS and Approximate MatchingSymposium on the Theory of Computing (STOC), 2023 |
 Distributed Half-Integral Matching and BeyondColloquium on Structural Information & Communication Complexity (SIROCCO), 2023 |
 Distributed Self-Stabilizing MIS with Few States and Weak CommunicationACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Fast Distributed Brooks' TheoremACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Chopin: Combining Distributed and Centralized Schedulers for
Self-Adjusting Datacenter NetworksInternational Conference on Principles of Distributed Systems (OPODIS), 2022 |
 Optimal Deterministic Massively Parallel Connectivity on ForestsACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Distributed Maximal Matching and Maximal Independent Set on HypergraphsACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Self-stabilization and byzantine tolerance for maximal independentSafety-critical Systems Symposium (SSS), 2021 |
 Making Self-Stabilizing any Locally Greedy ProblemSymposium on Algorithmic Foundations of Dynamic Networks (AFDN), 2022 |
 Exponential Speedup Over Locality in MPC with Optimal MemoryInternational Symposium on Distributed Computing (DISC), 2022 |
 A Speedup Theorem for Asynchronous Computation with Applications to
Consensus and Approximate AgreementACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Distributed Edge Coloring in Time Polylogarithmic in ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Distributed MIS in Awake ComplexityACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 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 |
 Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree
Dominating Sets in TreesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Local Problems on Trees from the Perspectives of Distributed Algorithms,
Finitary Factors, and Descriptive CombinatoricsInformation Technology Convergence and Services (ITCS), 2021 |
 Component Stability in Low-Space Massively Parallel ComputationACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Distributed Graph Coloring Made EasyACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021 |
 Locally Checkable Labelings with Small MessagesInternational Symposium on Distributed Computing (DISC), 2021 |
 Locally Checkable Problems in Rooted TreesDistributed computing (Distrib. Comput.), 2021 |
 Local Conflict Coloring Revisited: Linial for ListsInternational Symposium on Distributed Computing (DISC), 2020 |
 Sleeping is Efficient: MIS in -rounds Node-averaged Awake
ComplexityACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Distributed Lower Bounds for Ruling SetsIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020 |
 The Topology of Local Computing in NetworksInternational Colloquium on Automata, Languages and Programming (ICALP), 2020 |
 Truly Tight-in- Bounds for Bipartite Maximal Matching and
VariantsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Distributed graph problems through an automata-theoretic lensColloquium on Structural Information & Communication Complexity (SIROCCO), 2020 |
 Distributed Maximum Matching Verification in CONGESTInternational Symposium on Distributed Computing (DISC), 2020 |
 A Breezing Proof of the KMW BoundSIAM Symposium on Simplicity in Algorithms (SOSA), 2020 |
