Spreading rumors rapidly despite an adversary

Journal of Algorithms

Volumn 26, Issue 2, 1998, Pages 386-411

  Aspnes, James ^a   Hurwood, William ^b,c  

^a Yale University   (United States)

^b MicroStrategy Inc   (Austria)

^c YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001086439     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0907     Document Type: Article

References (36)

1. K. Abrahamson, On achieving consensus using a shared memory, in "Proceedings of the 7th ACM Symposium on Principles of Distributed Computing," August 1988, pp. 291-302.
2. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, Atomic snapshots of shared memory, in "Proceedingsof the 9th ACM Symposium on Principles of Distributed Computing," 1990, pp. 1-13.
3. M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts, A theory of competitive analysis for distributed algorithms, in "Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science," November 1994, pp. 401-411. Full version available.
4. J. Anderson, Composite registers, in "Proceedings of the 9th ACM Symposium on Principles of Distributed Computing," August 1990, pp. 15-30.
5. R. Anderson and H. Woll, Wait-free parallel algorithms for the union-find problem, in "Proceedings of the 23rd ACM Symposium on Theory of Computing," 1991, pp. 370-380.
6. J. Aspnes, Time- and space-efficient randomized consensus, J. Algorithms 14(3), May (1993), 414-431. An earlier version appeared in "Proceedings of the 9th ACM Symposium on Principles of Distributed Computing," August 1990, pp. 325-331.
7. J. Aspnes, Time- and space-efficient randomized consensus, J. Algorithms 14(3), May (1993), 414-431. An earlier version appeared in "Proceedings of the 9th ACM Symposium on Principles of Distributed Computing," August 1990, pp. 325-331.
8. J. Aspnes, and M. Herlihy, Fast randomized consensus using shared memory, J. Algorithms 11(3) (1990), 441-451.
9. J. Aspnes and M. P. Herlihy, Wait-free data structures in the asynchronous PRAM model, in "Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures," Crete, Greece, July 1990, pp. 340-349.
10. 2 n) operations per processor, in "Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science," October 1992, pp. 137-146.
11. J. Aspnes and O. Waarts, Modular competitiveness for distributed algorithms, in "Proceedings of the 28th ACM Symposium on Theory of Computing," May 1996, pp. 237-246.
12. Y. Aumann and M. A. Bender, Efficient asynchronous consensus with the value-oblivious adversary scheduler, in "ICALP '96," to appear.
13. H. Attiya, M. Herlihy, and O. Rachman, "Efficient Atomic Snapshots Using Lattice Agreement," Technical report, Technion, Haifa, Israel, 1992. A preliminary version appeared in "Proceedingsof the 6th International Workshop on Distributed Algorithms" (A. Segall and S. Zaks, Eds.), Lecture Notes in Computer Science, Vol. 647, pp. 35-53, Springer-Verlag, Berlin, 1992.
14. H. Attiya, M. Herlihy, and O. Rachman, "Efficient Atomic Snapshots Using Lattice Agreement," Technical report, Technion, Haifa, Israel, 1992. A preliminary version appeared in "Proceedingsof the 6th International Workshop on Distributed Algorithms" (A. Segall and S. Zaks, Eds.), Lecture Notes in Computer Science, Vol. 647, pp. 35-53, Springer-Verlag, Berlin, 1992.
15. H. Attiya and O. Rachman, Atomic snapshots in O(n log n) operations, in "Proceedings of the 12th ACM Symposium on Principles of Distributed Computing," August 1993, pp. 29-40.
16. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the power of randomization in online algorithms, in "Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing," pp. 379-386, ACM, New York, 1990.
17. E. Borowsky and E. Gafni, Immediate atomic snapshots and fast renaming, in "Proceedings of the 12th ACM Symposium on Principles of Distributed Computing," August 1993, pp. 41-51.
18. 2 log n) operations, in "Proceedings of the Fifth International Workshop on Distributed Algorithms," Springer-Verlag, Berlin, 1991.
19. T. Chandra and C. Dwork, Using consensus to solve atomic snapshots, submitted for publication.
20. To Chandra, Polylog randomized wait-free consensus, in "Proceedings of the 15th ACM Symposium on Principles of Distributed Computing," May 1996, pp. 166-175.
21. B. Chor, A. Israeli, and M. Li, On processor coordination using asynchronous hardware, in "Proceedings of the 6th ACM Symposium on Principles of Distributed Computing," 1987, pp. 86-97.
22. D. Dolev and N. Shavit, Bounded concurrent time-stamp systems are constructible!, in "Proceedings of the 21st ACM Symposium on Theory of Computing," 1989, pp. 454-465, An extended version appears in IBM research report RJ 6785, March 1990.
23. C. Dwork, M. Herlihy, S. Plotkin, and O. Waarts, Time-lapse snapshots, in "Proceedings of Israel Symposium on the Theory of Computing and Systems," 1992.
24. C. Dwork, M. Herlihy, and O. Waarts, Bounded round numbers, in "Proceedingsof the 12th ACM Symposium on Principles of Distributed Computing," 1993, pp. 53-64.
25. C. Dwork and O. Waarts, Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!, in "Proceedings of the 24th ACM Symposium on Theory of Computing," 1992, pp. 655-666.
26. S. Even and B. Monien, On the number of rounds needed to disseminate information, in "Proceedingsof the First Annual ACM Symposium on Parallel Algorithmsand Architectures," 1989.
27. R. Gawlick, N. Lynch, and N. Shavit, Concurrent timestamping made simple, in "Proceedingsof Israel Symposium on Theory of Computing and Systems," 1992.
28. S. Haldar, Efficient bounded timestamping using traceable use abstraction - Is writer's guessing better than reader's telling?, technical report RUU-CS-93-28, Department of Computer Science, Utrecht, September 1993.
29. M. P. Herlihy, Randomized wait-free concurrent objects, in "Proceedings of the 10th ACM Symposium on Principles of Distributed Computing," August 1991.
30. A. Israeli and M. Li, Bounded time stamps, in "Proceedings of the 28th IEEE Symposium on Foundations of Computer Science," 1987.
31. A. Israeli and M. Pinhasov, A concurrent time-stamp scheme which is linear in time and space, manuscript, 1991.
32. L. M. Kirousis, P. Spirakis, and P. Tsigas, Reading many variables in one atomic operation: Solutions with linear or sublinear complexity, in "Proceedings of the 5th International Workshop on Distributed Algorithms," 1991.
33. Y. Riany, N. Shavit, and D. Touitou, Practical snapshots, in "Proceedings of Israel Symposium on Theory of Computing and Systems," 1994.
34. M. Saks, N. Shavit, and H. Woll, Optimal time randomized consensus - making resilient algorithms fast in practice, in "Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms," 1991, pp. 351-362.
35. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28(2) (1985), 202-208.
36. P. M. B. Vitanyi and B. Awerbuch, Atomic shared register access by asynchronous hardware, in "Proceedings of the 27th IEEE Symposium on Foundations of Computer Science," 1986.