8 citations · 11 across the 3 of their papers we have counts for
Showing 2018 · cs.DCShow all
2 papers · 2 filters
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…