19 citations · 110 across the 50 of their papers we have counts for
11 papers · 1 filter
Distributed Interactive Proofs for Planarity with Log-Star Communication
Yuval Gil, Merav Parter
We provide new communication-efficient distributed interactive proofs for planarity. The notion of a \emph{distributed interactive proof (DIP)} was introduced by Kol, Oshman, and S…
Distributed Maximum Flow in Planar Graphs
Yaseen Abd-Elhaleem, Michal Dory, Merav Parter +1
The dual of a planar graph is a planar graph that has a vertex for each face of and an edge for each pair of adjacent faces of . The profound relationship between…
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers
Merav Parter
Fault tolerant distance preservers (spanners) are sparse subgraphs that preserve (approximate) distances between given pairs of vertices under edge or vertex failures. So-far, thes…
Spiking Neural Networks Through the Lens of Streaming Algorithms
Yael Hitron, Cameron Musco, Merav Parter
We initiate the study of biological neural networks from the perspective of streaming algorithms. Like computers, human brains suffer from memory limitations which pose a significa…
Winner-Take-All Computation in Spiking Neural Networks
Nancy Lynch, Cameron Musco, Merav Parter
In this work we study biological neural networks from an algorithmic perspective, focusing on understanding tradeoffs between computation time and network complexity. Our goal is t…
Parallel Balanced Allocations: The Heavily Loaded Case
Christoph Lenzen, Merav Parter, Eylon Yogev
We study parallel algorithms for the classical balls-into-bins problem, in which balls acting in parallel as separate agents are placed into bins. Algorithms operate in syn…