3 citations · 10 across the 9 of their papers we have counts for
4 papers · 1 filter
Strong Byzantine Agreement with Adaptive Word Complexity
Pierre Civit, Seth Gilbert, Rachid Guerraoui +2
The strong Byzantine agreement (SBA) problem is defined among n processes, out of which t < n can be faulty and behave arbitrarily. SBA allows correct (non-faulty) processes to agr…
Every Bit Counts in Consensus
Pierre Civit, Seth Gilbert, Rachid Guerraoui +3
Consensus enables n processes to agree on a common valid L-bit value, despite t < n/3 processes being faulty and acting arbitrarily. A long line of work has been dedicated to impro…
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert +2
Contention resolution addresses the problem of coordinating access to a shared channel. Time proceeds in slots, and a packet transmission can be made in any slot. A packet is succe…
On the Validity of Consensus
Pierre Civit, Seth Gilbert, Rachid Guerraoui +2
The Byzantine consensus problem involves processes, out of which t < n could be faulty and behave arbitrarily. Three properties characterize consensus: (1) termination, requiri…