On the importance of having an identity or, is consensus really universal?
Authors:
- Harry BuhrmanHBHarry Buhrman
- Paul VitanyiPVPaul Vitanyi
- 10 March 2005
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 18 (3) , 167-176
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Lower bounds for distributed coin-flipping and randomized consensusJournal of the ACM, 1998
- Efficient asynchronous consensus with the weak adversary scheduler1997
- Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per ProcessorSIAM Journal on Computing, 1996
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Polylog randomized wait-free consensus1996
- Time- and Space-Efficient Randomized ConsensusJournal of Algorithms, 1993
- Immediate atomic snapshots and fast renaming1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990