Marc Dufay
Distributed Computing Group
Computer Engineering and Networks Laboratory (TIK)
Department Electrical Engineering (D-ITET)
Office ETZ G 93
ETH Zurich
Gloriastrasse 35
8092 Zurich
Switzerland
Publications
-
Predictions Can Only Help! Communication Efficient Byzantine Agreement with Predictions
Marc Dufay, Muhammad Ayaz Dzulfikar and Seth Gilbert.
40th International Symposium on Distributed Computing (DISC), Rome, Italy, November 2026.
BibTeX -
General Convex Agreement with Near-Optimal Communication
Marc Dufay, Diana Ghinea and Anton Paramonov.
40th International Symposium on Distributed Computing (DISC), Rome, Italy, November 2026.
BibTeX -
Brief Announcement: Optimal Adaptive Multi-Valued Byzantine Agreement
Marc Dufay, Anton Paramonov and Roger Wattenhofer.
40th International Symposium on Distributed Computing (DISC), Rome, Italy, November 2026.
BibTeX -
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Anton Paramonov and Roger Wattenhofer.
45th ACM Symposium on Principles of Distributed Computing (PODC), Egham, England, July 2026.
BibTeX -
A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
Marc Dufay and Roger Wattenhofer.
ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, Canada, January 2026.
BibTeX -
Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication
Andrei Constantinescu, Marc Dufay, Anton Paramonov and Roger Wattenhofer.
39th International Symposium on Distributed Computing (DISC), Berlin, Germany, October 2025.
External Slides (PDF) BibTeX -
Validity in Network-Agnostic Byzantine Agreement (Highlighted paper)
Andrei Constantinescu, Marc Dufay, Diana Ghinea and Roger Wattenhofer.
39th International Symposium on Distributed Computing (DISC), Berlin, Germany, October 2025.
External Slides (PDF) BibTeX -
Byzantine Stable Matching (Best paper award)
Andrei Constantinescu, Marc Dufay, Diana Ghinea and Roger Wattenhofer.
44th ACM Symposium on Principles of Distributed Computing (PODC), Huatulco, Mexico, June 2025.
External Slides (PDF) BibTeX
Theses & Labs
Available Theses & Labs | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Title | Type | Contact/Supervisor | Assigned | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
 | Consensus: Fast and Lite | M/S | Anton Paramonov, Marc Dufay | available | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Past Theses & Labs | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Title | Type | Contact/Supervisor | Assigned | Student(s) | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
 | Communication-Efficient Byzantine Agreement and All-to-All Communication under Adversarial Link Corruptions [confidential] | S | Marc Dufay, Mose Mizrahi Erbes | FS 26 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
 | More Efficient Byzantine Stable Matching [confidential] | S | Marc Dufay | HS 25 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||