No. |
Title |
Author |
Year |
---|

1 |
Secure Distributed Network Optimization Against Eavesdroppers |
Hitron, Yael et al. |
2023 |

2 |
Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts |
Kogan, Shimon et al. |
2022 |

3 |
Broadcast CONGEST Algorithms Against Eavesdroppers |
Hitron, Yael et al. |
2022 |

4 |
Near-Optimal Distributed Computation of Small Vertex Cuts |
Parter, Merav et al. |
2022 |

5 |
Õptimal Dual Vertex Failure Connectivity Labels |
Parter, Merav et al. |
2022 |

6 |
Broadcast CONGEST Algorithms against Adversarial Edges |
Hitron, Yael et al. |
2021 |

7 |
General CONGEST Compilers against Adversarial Edges |
Hitron, Yael et al. |
2021 |

8 |
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers |
Parter, Merav |
2020 |

9 |
Distributed Planar Reachability in Nearly Optimal Time |
Parter, Merav |
2020 |

10 |
New Fault Tolerant Subset Preservers |
Bodwin, Greg et al. |
2020 |

11 |
On Packing Low-Diameter Spanning Trees |
Chuzhoy, Julia et al. |
2020 |

12 |
Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks |
Hitron, Yael et al. |
2020 |

13 |
Spiking Neural Networks Through the Lens of Streaming Algorithms |
Hitron, Yael et al. |
2020 |

14 |
The Computational Cost of Asynchronous Neural Communication |
Hitron, Yael et al. |
2020 |

15 |
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons |
Hitron, Yael et al. |
2019 |

16 |
Optimal Short Cycle Decomposition in Almost Linear Time |
Parter, Merav et al. |
2019 |

17 |
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach |
Parter, Merav |
2019 |

18 |
(Delta+1) Coloring in the Congested Clique Model |
Parter, Merav |
2018 |

19 |
Congested Clique Algorithms for Graph Spanners |
Parter, Merav et al. |
2018 |

20 |
Efficient Oracles and Routing Schemes for Replacement Paths |
Bilò, Davide et al. |
2018 |

21 |
Local Computation Algorithms for Spanners |
Parter, Merav et al. |
2018 |

22 |
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds |
Parter, Merav et al. |
2018 |

23 |
Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks |
Lynch, Nancy et al. |
2017 |

24 |
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions |
Censor-Hillel, Keren et al. |
2017 |

25 |
Improved Deterministic Distributed Construction of Spanners |
Grossman, Ofer et al. |
2017 |

26 |
Near-Optimal Distributed DFS in Planar Graphs |
Ghaffari, Mohsen et al. |
2017 |

27 |
Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks |
Lynch, Nancy et al. |
2017 |

28 |
Preserving Distances in Very Faulty Graphs |
Bodwin, Greg et al. |
2017 |