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


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