2 citations · 2 across the 3 of their papers we have counts for
5 papers
MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
Daniel Manor, Mor Perry, Moshe Sulamy
In concurrent data structures, the efficiency of set operations can vary significantly depending on the workload characteristics. Numerous concurrent set implementations are optimi…
Distributed Non-Interactive Zero-Knowledge Proofs
Alex B. Grilo, Ami Paz, Mor Perry
Distributed certification is a set of mechanisms that allows an all-knowing prover to convince the units of a communication network that the network's state has some desired proper…
Redundancy in Distributed Proofs
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen +2
Distributed proofs are mechanisms enabling the nodes of a network to collectivity and efficiently check the correctness of Boolean predicates on the structure of the network, or on…
Proof-Labeling Schemes: Broadcast, Unicast and In Between
Boaz Patt-Shamir, Mor Perry
We study the effect of limiting the number of different messages a node can transmit simultaneously on the verification complexity of proof-labeling schemes (PLS). In a PLS, each n…
Space-Time Tradeoffs for Distributed Verification
Rafail Ostrovsky, Mor Perry, Will Rosenbaum
Verifying that a network configuration satisfies a given boolean predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for…