19 citations · 50 across the 19 of their papers we have counts for
24 papers
The Smart Contract Model
Yackolley Amoussou-Guenou, Maurice Herlihy, Sucharita Jayanti +2
Many of the problems that arise in the context of blockchains and decentralized finance can be seen as variations on classical problems of distributed computing. The smart contract…
Simplicial Models for the Epistemic Logic of Faulty Agents
Eric Goubault, Roman Kniazev, Jeremy Ledent +1
In recent years, several authors have been investigating simplicial models, a model of epistemic logic based on higher-dimensional structures called simplicial complexes. In the or…
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…
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…
Semi-simplicial Set Models for Distributed Knowledge
Eric Goubault, Roman Kniazev, Jérémy Ledent +1
In recent years, a new class of models for multi-agent epistemic logic has emerged, based on simplicial complexes. Since then, many variants of these simplicial models have been in…
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
We study two fundamental problems of distributed computing, consensus and approximate agreement, through a novel approach for proving lower bounds and impossibility results, that w…