5 citations · 6 across the 2 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2023★ 1 cited
Swiper: a new paradigm for efficient weighted distributed protocols
Andrei Tonkikh, Luciano Freitas
The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction of parties can be corrupted by the adversa…
cs.DC2022
Distributed Randomness from Approximate Agreement
Luciano Freitas, Petr Kuznetsov, Andrei Tonkikh
Randomisation is a critical tool in designing distributed systems. The common coin primitive, enabling the system members to agree on an unpredictable random number, has proven to…