| No. |
Title |
Author |
Year |
| 1 |
Every Bit Counts in Consensus |
Civit, Pierre et al. |
2023 |
| 2 |
On the Inherent Anonymity of Gossiping |
Guerraoui, Rachid et al. |
2023 |
| 3 |
Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony! |
Civit, Pierre et al. |
2022 |
| 4 |
Oracular Byzantine Reliable Broadcast |
Camaioni, Martina et al. |
2022 |
| 5 |
AKSEL: Fast Byzantine SGD |
Boussetta, Amine et al. |
2021 |
| 6 |
Dynamic Byzantine Reliable Broadcast |
Guerraoui, Rachid et al. |
2021 |
| 7 |
Frugal Byzantine Computing |
Aguilera, Marcos K. et al. |
2021 |
| 8 |
Demystifying Bitcoin (Keynote Abstract) |
Guerraoui, Rachid |
2020 |
| 9 |
Efficient Multi-Word Compare and Swap |
Guerraoui, Rachid et al. |
2020 |
| 10 |
Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols |
Bellet, Aurélien et al. |
2020 |
| 11 |
Scalable Byzantine Reliable Broadcast |
Guerraoui, Rachid et al. |
2019 |
| 12 |
State Machine Replication Is More Expensive Than Consensus |
Antoniadis, Karolos et al. |
2018 |
| 13 |
Collision-Free Pattern Formation |
Guerraoui, Rachid et al. |
2017 |
| 14 |
The Benefits of Entropy in Population Protocols |
Beauquier, Joffroy et al. |
2016 |
