| No. |
Title |
Author |
Year |
| 1 |
(Delta+1) Coloring in the Congested Clique Model |
Parter, Merav |
2018 |
| 2 |
Congested Clique Algorithms for Graph Spanners |
Parter, Merav et al. |
2018 |
| 3 |
Efficient Oracles and Routing Schemes for Replacement Paths |
Bilò, Davide et al. |
2018 |
| 4 |
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds |
Parter, Merav et al. |
2018 |
| 5 |
Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks |
Lynch, Nancy et al. |
2017 |
| 6 |
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions |
Censor-Hillel, Keren et al. |
2017 |
| 7 |
Improved Deterministic Distributed Construction of Spanners |
Grossman, Ofer et al. |
2017 |
| 8 |
Near-Optimal Distributed DFS in Planar Graphs |
Ghaffari, Mohsen et al. |
2017 |
| 9 |
Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks |
Lynch, Nancy et al. |
2017 |
| 10 |
Preserving Distances in Very Faulty Graphs |
Bodwin, Greg et al. |
2017 |
