| Publication | Date of Publication | Type |
|---|
Towards bypassing lower bounds for graph shortcuts
| 2025-01-06 | Paper |
Fault-tolerant spanners against bounded-degree edge failures: linearly more faults, almost for free
| 2024-11-28 | Paper |
New additive emulators
| 2024-11-14 | Paper |
Secure distributed network optimization against eavesdroppers
| 2024-09-25 | Paper |
Near-optimal distributed computation of small vertex cuts
Distributed Computing | 2024-07-26 | Paper |
New diameter-reducing shortcuts and directed hopsets: breaking the \(O(\sqrt{n})\) barrier
| 2024-07-19 | Paper |
Beating matrix multiplication for \(n^{1/3}\)-directed shortcuts
| 2024-06-24 | Paper |
Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers
| 2024-05-14 | Paper |
Component stability in low-space massively parallel computation
Distributed Computing | 2024-04-09 | Paper |
Low-Congestion Shortcuts in Constant Diameter Graphs
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Fault-Tolerant Labeling and Compact Routing Schemes
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Improved Deterministic (Δ+1) Coloring in Low-Space MPC
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Component Stability in Low-Space Massively Parallel Computation
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
A Graph Theoretic Approach for Resilient Distributed Algorithms
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Distributed CONGEST Algorithms against Mobile Adversaries
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Deterministic replacement path covering
| 2024-01-15 | Paper |
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7774274 (Why is no real title available?)
| 2023-12-08 | Paper |
scientific article; zbMATH DE number 7774275 (Why is no real title available?)
| 2023-12-08 | Paper |
Distributed planar reachability in nearly optimal time
| 2023-11-02 | Paper |
Spiking neural networks through the lens of streaming algorithms
| 2023-11-02 | Paper |
Distributed constructions of dual-failure fault-tolerant distance preservers
| 2023-11-02 | Paper |
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Exponentially Faster Shortest Paths in the Congested Clique
Journal of the ACM | 2023-04-27 | Paper |
Improved deterministic distributed construction of spanners
| 2023-02-03 | Paper |
Small cuts and connectivity certificates: a fault tolerant approach
| 2023-02-03 | Paper |
Near-optimal distributed DFS in planar graphs
| 2023-02-03 | Paper |
Derandomizing local distributed algorithms under bandwidth restrictions
| 2023-02-03 | Paper |
Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks
| 2023-02-03 | Paper |
Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks.
| 2023-02-03 | Paper |
The Computational Cost of Asynchronous Neural Communication
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561582 (Why is no real title available?)
| 2022-07-21 | Paper |
Congested clique algorithms for graph spanners
| 2022-07-21 | Paper |
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
| 2022-07-21 | Paper |
Local computation algorithms for spanners
| 2022-07-18 | Paper |
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons.
| 2022-05-11 | Paper |
Invited talk: Resilient distributed algorithms
| 2022-03-24 | Paper |
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
SIAM Journal on Computing | 2021-11-19 | Paper |
\((\Delta+1)\) coloring in the congested clique model
| 2021-07-28 | Paper |
Nonuniform SINR+Voronoi diagrams are effectively uniform
Theoretical Computer Science | 2021-07-22 | Paper |
Exponentially Faster Shortest Paths in the Congested Clique
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
The power of distributed verifiers in interactive proofs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
New (α, β) Spanners and Hopsets
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Secure Distributed Computing Made (Nearly) Optimal
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Fault tolerant approximate BFS structures with additive stretch
Algorithmica | 2020-11-11 | Paper |
Efficient oracles and routing schemes for replacement paths
| 2020-08-05 | Paper |
Derandomizing local distributed algorithms under bandwidth restrictions
Distributed Computing | 2020-06-15 | Paper |
Preserving distances in very faulty graphs
| 2020-05-27 | Paper |
Planar diameter via metric compression
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Low congestion cycle covers and their applications
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Distributed algorithms made secure: a graph theoretic approach
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Fault-tolerant logical network structures
| 2019-07-03 | Paper |
Fault Tolerant Approximate BFS Structures
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Generalized Perron-Frobenius theorem for multiple choice matrices, and applications
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
SINR diagram with interference cancellation
| 2019-05-10 | Paper |
Fault-tolerant approximate BFS structures
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Sparse Fault-Tolerant BFS Structures
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Computing in additive networks with bounded-information codes
| 2018-08-24 | Paper |
Nonuniform SINR+Voroni diagrams are effectively uniform
| 2018-08-24 | Paper |
The topology of wireless communication
Journal of the ACM | 2018-08-02 | Paper |
Local-on-average distributed tasks
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Computational tradeoffs in biological neural networks: self-stabilizing winner-take-all networks
| 2018-05-03 | Paper |
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
| 2018-03-15 | Paper |
The topology of wireless communication on a line
Theoretical Computer Science | 2018-02-16 | Paper |
Vertex fault tolerant additive spanners
Distributed Computing | 2018-01-17 | Paper |
Secluded connectivity problems
Algorithmica | 2017-11-09 | Paper |
A polylogarithmic gossip algorithm for plurality consensus
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
MST in log-star rounds of congested clique
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Dual failure resilient BFS structure
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Randomized distributed decision
Distributed Computing | 2015-02-23 | Paper |
Vertex fault tolerant additive spanners
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Testing the irreducibility of nonsquare Perron-Frobenius systems
Information Processing Letters | 2014-08-28 | Paper |
Bypassing Erdős' girth conjecture: hybrid stretch and sourcewise spanners
Automata, Languages, and Programming | 2014-07-01 | Paper |
The topology of wireless communication
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Sparse fault-tolerant BFS trees
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Secluded connectivity problems
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Randomized distributed decision
Lecture Notes in Computer Science | 2013-03-13 | Paper |
