Spreading Rumors Rapidly Despite an Adversary
Authors:
- James AspnesJAJames Aspnes
- William HurwoodWHWilliam Hurwood
Open Access
- 1 February 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 26 (2) , 386-411
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Polylog randomized wait-free consensus1996
- Modular competitiveness for distributed algorithms1996
- Time- and Space-Efficient Randomized ConsensusJournal of Algorithms, 1993
- Composite registersDistributed Computing, 1993
- Immediate atomic snapshots and fast renaming1993
- Efficient atomic snapshots using lattice agreement1992
- Wait-free parallel algorithms for the union-find problem1991
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990
- Wait-free data structures in the asynchronous PRAM model1990
- On achieving consensus using a shared memory1988