Communication dans un congrès, ParSys, Calcul parallèle, distribué et partagé, Informatique

The Time Complexity of Consensus Under Oblivious Message Adversaries

Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid. The Time Complexity of Consensus Under Oblivious Message Adversaries. ITCS23, Jan 2023, Cambridge, United States. ⟨10.4230/LIPIcs.ITCS.2023.100⟩. ⟨hal-04288670⟩

Publié le