Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

1 Publication

2018 | Conference Paper | LibreCat-ID: 3422
Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399
LibreCat | Files available | DOI

Filters and Search Terms

keyword="complexity lower bound"


Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed