19 citations · 50 across the 19 of their papers we have counts for
Showing 2023 · cs.DCShow all
2 papers · 2 filters
cs.DC2023★ 2 cited
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud +2
The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (STOC 1993 and STOC 1994) provided a topological characterization of the tasks that are solvable in a distri…
cs.DC2023
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks
Hagit Attiya, Pierre Fraigniaud, Ami Paz +1
The paper compares two generic techniques for deriving lower bounds and impossibility results in distributed computing. First, we prove a speedup theorem (a-la Brandt, 2019), for w…