No. Title Author Year
1 New Fault Tolerant Subset Preservers Bodwin, Greg et al. 2020
2 On Packing Low-Diameter Spanning Trees Chuzhoy, Julia et al. 2020
3 Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks Hitron, Yael et al. 2020
4 The Computational Cost of Asynchronous Neural Communication Hitron, Yael et al. 2020
5 Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons Hitron, Yael et al. 2019
6 Optimal Short Cycle Decomposition in Almost Linear Time Parter, Merav et al. 2019
7 Small Cuts and Connectivity Certificates: A Fault Tolerant Approach Parter, Merav 2019
8 (Delta+1) Coloring in the Congested Clique Model Parter, Merav 2018
9 Congested Clique Algorithms for Graph Spanners Parter, Merav et al. 2018
10 Efficient Oracles and Routing Schemes for Replacement Paths Bilò, Davide et al. 2018
11 Local Computation Algorithms for Spanners Parter, Merav et al. 2018
12 Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds Parter, Merav et al. 2018
13 Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks Lynch, Nancy et al. 2017
14 Derandomizing Local Distributed Algorithms under Bandwidth Restrictions Censor-Hillel, Keren et al. 2017
15 Improved Deterministic Distributed Construction of Spanners Grossman, Ofer et al. 2017
16 Near-Optimal Distributed DFS in Planar Graphs Ghaffari, Mohsen et al. 2017
17 Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks Lynch, Nancy et al. 2017
18 Preserving Distances in Very Faulty Graphs Bodwin, Greg et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 18


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI