8 citations · 8 across the 2 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DC2018
The Power of Distributed Verifiers in Interactive Proofs
Moni Naor, Merav Parter, Eylon Yogev
We explore the power of interactive proofs with a distributed verifier. In this setting, the verifier consists of nodes and a graph that defines their communication pattern…
cs.DC2018
Low Congestion Cycle Covers and their Applications
Merav Parter, Eylon Yogev
A cycle cover of a bridgeless graph is a collection of simple cycles in such that each edge appears on at least one cycle. The common objective in cycle cover computati…
cs.DS2018
Congested Clique Algorithms for Graph Spanners
Merav Parter, Eylon Yogev
Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide rang…