17 citations · 66 across the 24 of their papers we have counts for
30 papers
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…
Smoothed Analysis of Information Spreading in Dynamic Networks
Michael Dinitz, Jeremy Fineman, Seth Gilbert +1
The best known solutions for -message broadcast in dynamic networks of size require rounds. In this paper, we see if these bounds can be improved by smoothed analysi…
Contention Resolution for Coded Radio Networks
Michael A. Bender, Seth Gilbert, Fabian Kuhn +2
Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a w…