| Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets | 0 | 0.34 | 2022 |
| SIMPLE, DETERMINISTIC, CONSTANT-ROUND COLORING IN CONGESTED CLIQUE AND MPC | 0 | 0.34 | 2021 |
| Broadcast CONGEST Algorithms against Adversarial Edges. | 0 | 0.34 | 2021 |
| Improved Deterministic (Δ+1) Coloring in Low-Space MPC | 0 | 0.34 | 2021 |
| Low-Congestion Shortcuts in Constant Diameter Graphs | 0 | 0.34 | 2021 |
| General CONGEST Compilers against Adversarial Edges. | 0 | 0.34 | 2021 |
| Deterministic Replacement Path Covering | 0 | 0.34 | 2021 |
| Component Stability in Low-Space Massively Parallel Computation | 0 | 0.34 | 2021 |
| Fault-Tolerant Labeling and Compact Routing Schemes | 0 | 0.34 | 2021 |
| Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space | 1 | 0.35 | 2021 |
| Nonuniform Sinr Plus Voronoi Diagrams Are Effectively Uniform | 0 | 0.34 | 2021 |
| Invited Talk - Resilient Distributed Algorithms. | 0 | 0.34 | 2021 |
| Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs | 0 | 0.34 | 2021 |
| Simple, Deterministic, Constant-Round Coloring in the Congested Clique | 0 | 0.34 | 2020 |
| Distributed Planar Reachability in Nearly Optimal Time. | 0 | 0.34 | 2020 |
| Spiking Neural Networks Through the Lens of Streaming Algorithms | 0 | 0.34 | 2020 |
| Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers | 0 | 0.34 | 2020 |
| Fault Tolerant Approximate Bfs Structures With Additive Stretch | 0 | 0.34 | 2020 |
| Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. | 0 | 0.34 | 2020 |
| New (α, β) Spanners and Hopsets. | 0 | 0.34 | 2020 |
| The Computational Cost of Asynchronous Neural Communication. | 0 | 0.34 | 2020 |
| New Fault Tolerant Subset Preservers. | 0 | 0.34 | 2020 |
| Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space | 0 | 0.34 | 2020 |
| On Packing Low-Diameter Spanning Trees | 0 | 0.34 | 2020 |
| Exponentially Faster Shortest Paths in the Congested Clique | 0 | 0.34 | 2020 |
| Parallel Balanced Allocations: The Heavily Loaded Case. | 1 | 0.35 | 2019 |
| Local Computation Algorithms for Spanners. | 0 | 0.34 | 2019 |
| Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. | 1 | 0.42 | 2019 |
| Secure Distributed Computing Made (Nearly) Optimal | 0 | 0.34 | 2019 |
| Optimal Short Cycle Decomposition in Almost Linear Time. | 0 | 0.34 | 2019 |
| Planar diameter via metric compression | 1 | 0.35 | 2019 |
| Winner-Take-All Computation in Spiking Neural Networks. | 0 | 0.34 | 2019 |
| Small Cuts and Connectivity Certificates - A Fault Tolerant Approach. | 0 | 0.34 | 2019 |
| Distributed Algorithms Made Secure - A Graph Theoretic Approach. | 0 | 0.34 | 2019 |
| Low Congestion Cycle Covers and their Applications. | 0 | 0.34 | 2019 |
| Efficient Oracles and Routing Schemes for Replacement Paths. | 0 | 0.34 | 2018 |
| (Δ+1) Coloring in the Congested Clique Model. | 0 | 0.34 | 2018 |
| The topology of wireless communication on a line. | 0 | 0.34 | 2018 |
| Optimal Vertex Fault Tolerant Spanners (for fixed stretch). | 0 | 0.34 | 2018 |
| The Power of Distributed Verifiers in Interactive Proofs. | 1 | 0.35 | 2018 |
| Wireless Expanders. | 0 | 0.34 | 2018 |
| (Delta+1) Coloring in the Congested Clique Model. | 0 | 0.34 | 2018 |
| Congested Clique Algorithms for Graph Spanners. | 1 | 0.35 | 2018 |
| Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds. | 0 | 0.34 | 2018 |
| Fault-Tolerant Approximate BFS Structures. | 1 | 0.36 | 2018 |
| Near-Optimal Distributed DFS in Planar Graphs. | 0 | 0.34 | 2017 |
| Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks. | 3 | 0.79 | 2017 |
| Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks. | 2 | 0.46 | 2017 |
| Improved Deterministic Distributed Construction of Spanners. | 2 | 0.45 | 2017 |
| Derandomizing local distributed algorithms under bandwidth restrictions | 4 | 0.46 | 2017 |
