23 citations · 49 across the 14 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DC2017
Revisionist Simulations: A New Approach to Proving Space Lower Bounds
Faith Ellen, Rati Gelashvili, Leqi Zhu
Determining the space complexity of -obstruction-free -set agreement for is an open problem. In -obstruction-free protocols, processes are required to return in…
cs.DC2017
Towards Reduced Instruction Sets for Synchronization
Rati Gelashvili, Idit Keidar, Alexander Spiegelman +1
Contrary to common belief, a recent work by Ellen, Gelashvili, Shavit, and Zhu has shown that computability does not require multicore architectures to support "strong" synchroniza…
cs.DC2017★ 4 cited
Space-Optimal Majority in Population Protocols
Dan Alistarh, James Aspnes, Rati Gelashvili
Population protocols are a model of distributed computing, in which agents with limited local state interact randomly, and cooperate to collectively compute global predicates.…