Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary

P. Robinson, C. Scheideler, A. Setzer, in:, Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.

Download
No fulltext has been uploaded. References only!
Conference Paper | Accepted | English
Publishing Year
Journal Title
Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
Conference
30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
Conference Location
Wien
Conference Date
2018-07-16 – 2018-07-18
LibreCat-ID

Cite this

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.
Robinson, P., Scheideler, C., & Setzer, A. (n.d.). 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). Wien. http://doi.org/10.1145/3210377.3210399
@inbook{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander}}
Robinson, Peter, Christian Scheideler, and Alexander Setzer. “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), n.d. doi:10.1145/3210377.3210399.
P. Robinson, C. Scheideler, and A. Setzer, “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), Wien.
Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). N.p. Web.
frontdoor.tabs.publications.cited_by
This publication cites the following data publications:

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar
ISBN Search