The time complexity of consensus under oblivious message adversaries

DOI10.4230/LIPICS.ITCS.2023.100MaRDI QIDQ6610374zbMATH OpenFDO

Authors Kyrill Winkler, Ami Paz, Galeana Hugo Rincon, Stefan Schmid, Ulrich Schmid

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2023.100

zbMATH Keywords

consensusdynamic networksoblivious message adversariestime complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Topological characterization of consensus in distributed systems

This page was built for publication: The time complexity of consensus under oblivious message adversaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610374)