Article dans une revue, ParSys, Calcul parallèle, distribué et partagé, Computer Science, Networking and Internet Architecture, Réseaux et télécommunications

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. Algorithmica, 2024, 86 (6), pp.1830-1861. ⟨10.1007/s00453-024-01209-4⟩. ⟨hal-04799403⟩

Published on