
LowCongestion Shortcuts in Constant Diameter Graphs
Low congestion shortcuts, introduced by Ghaffari and Haeupler (SODA 2016...
read it

Component Stability in LowSpace Massively Parallel Computation
We study the power and limitations of componentstable algorithms in the...
read it

FaultTolerant Labeling and Compact Routing Schemes
The paper presents faulttolerant (FT) labeling schemes for general grap...
read it

Restorable Shortest Path Tiebreaking for EdgeFaulty Graphs
The restoration lemma by Afek, BremlerBarr, Kaplan, Cohen, and Merritt ...
read it

Distributed Constructions of DualFailure FaultTolerant Distance Preservers
Fault tolerant distance preservers (spanners) are sparse subgraphs that ...
read it

Spiking Neural Networks Through the Lens of Streaming Algorithms
We initiate the study of biological neural networks from the perspective...
read it

Simple, Deterministic, ConstantRound Coloring in the Congested Clique
We settle the complexity of the (Δ+1)coloring and (Δ+1)list coloring p...
read it

Deterministic Replacement Path Covering
In this article, we provide a unified and simplified approach to derando...
read it

On Packing LowDiameter Spanning Trees
Edge connectivity of a graph is one of the most fundamental graphtheore...
read it

RoundEfficient Distributed Byzantine Computation
We present the first round efficient algorithms for several fundamental ...
read it

Exponentially Faster Shortest Paths in the Congested Clique
We present improved deterministic algorithms for approximating shortest ...
read it

Planar Diameter via Metric Compression
We develop a new approach for distributed distance computation in planar...
read it

Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
The Massively Parallel Computation (MPC) model is an emerging model whic...
read it

Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
We revisit classical connectivity problems in the CONGEST model of distr...
read it

New (α,β) Spanners and Hopsets
An f(d)spanner of an unweighted nvertex graph G=(V,E) is a subgraph H ...
read it

WinnerTakeAll Computation in Spiking Neural Networks
In this work we study biological neural networks from an algorithmic per...
read it

Parallel Balanced Allocations: The Heavily Loaded Case
We study parallel algorithms for the classical ballsintobins problem, ...
read it

Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons
We consider the task of measuring time with probabilistic threshold gate...
read it

Local Computation Algorithms for Spanners
A graph spanner is a fundamental graph structure that faithfully preserv...
read it

The Power of Distributed Verifiers in Interactive Proofs
We explore the power of interactive proofs with a distributed verifier. ...
read it

Low Congestion Cycle Covers and their Applications
A cycle cover of a bridgeless graph G is a collection of simple cycles i...
read it

Congested Clique Algorithms for Graph Spanners
Graph spanners are sparse subgraphs that faithfully preserve the distanc...
read it

(Δ+1) Coloring in the Congested Clique Model
In this paper, we present improved algorithms for the (Δ+1) (vertex) col...
read it

Wireless Expanders
This paper introduces an extended notion of expansion suitable for radio...
read it

Distributed Computing Made Secure: A New Cycle Cover Theorem
In the area of distributed graph algorithms a number of network's entiti...
read it

NeuroRAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks
We study distributed algorithms implemented in a simplified biologically...
read it

Computational Tradeoffs in Biological Neural Networks: SelfStabilizing WinnerTakeAll Networks
We initiate a line of investigation into biological neural networks from...
read it
Merav Parter
is this you? claim profile