3 citations · 5 across the 10 of their papers we have counts for
5 papers · 1 filter
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Anton Paramonov +1
Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastruct…
Byzantine Stable Matching
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who…
Validity in Network-Agnostic Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
Byzantine Agreement (BA) considers a setting of parties, out of which up to can exhibit byzantine (malicious) behavior. Honest parties must decide on a common value (agreem…
Unifying Partial Synchrony
Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski +1
The distributed computing literature considers multiple options for modeling communication. Most simply, communication is categorized as either synchronous or asynchronous. Synchro…
A Fair and Resilient Decentralized Clock Network for Transaction Ordering
Andrei Constantinescu, Diana Ghinea, Lioba Heimbach +2
Traditional blockchain design gives miners or validators full control over transaction ordering, i.e., they can freely choose which transactions to include or exclude, as well as i…