8 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.DC2019★ 8 cited
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…
cs.CR2014
Secret-Sharing for NP
Ilan Komargodski, Moni Naor, Eylon Yogev
A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a "qualified" subset of parti…