On the power of anonymous One-way communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3974 LNCS, Issue , 2006, Pages 396-411

  Angluin, Dana ^a   Aspnes, James ^a   Eisenstat, David ^b   Ruppert, Eric ^c  

^a YALE UNIVERSITY   (United States)

^b University of Rochester   (United States)

^c YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED SYSTEMS; FINITE-STATE; PROCESS STATE; PROCESSOR POWER;

SENSOR NETWORKS;

MESSAGE PASSING;

EID: 84870857565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11795490_30     Document Type: Conference Paper

References (23)

1. Dana Angluin. Local and global properties in networks of processors. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 82-93, 1980.
2. Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, and René Peralta. Stably computable properties of network graphs. IEEE/A CM International Conference on Distributed Computing in Sensor Systems, June 2005.
3. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. In Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, pages 290-299, 2004.
4. James Aspnes, Gauri Shah, and Jatin Shah. Wait-free consensus with infinite arrivals. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 524-533, 2002.
5. Hagit Attiya, Alla Gorbach, and Shlomo Moran. Computing in totally anonymous asynchronous shared memory systems. Information and Computation, 173(2): 162-183, March 2002.
6. Paolo Boldi and Sebastiano Vigna. Computing anonymously with arbitrary knowledge. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pages 173-179, 1999.
7. Paolo Boldi and Sebastiano Vigna. An effective characterization of computability in anonymous networks. In Distributed Computing, 15th International Conference, pages 33-47, 2001.
8. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, and Paul Vitanyi. On the importance of having an identity or, is consensus really universal? Distributed Computing, 18(3):167-176, 2006.
9. D. J. Daley and D. G. Kendall. Stochastic rumours. Journal of the Institute of Mathematics and its Applications, 1:42-55, 1965.
10. Zoë Diamadi and Michael J. Fischer. A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences, 6(1-2):72-82, March 2001. Also appears as Yale Technical Report TR-1207, January 2001.
11. Ömer Eǧecioǧlu and Ambuj K. Singh. Naming symmetric processes using shared variables. Distributed Computing, 8(1):19-38, 1994.
12. Faith Fich and Eric Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2-3):121-163, September 2003.
13. Daniel T. Gillespie. A rigorous derivation of the chemical master equation. Physica A, 188:404-425, 1992.
14. Seymour Ginsburg. The Mathematical Theory of Context Free Languages. McGraw-Hill, New York, 1966.
15. Rachid Guerraoui and Eric Ruppert. What can be implemented anonymously? In 19th International Symposium on Distributed Computing, pages 244-259, 2005.
16. G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 3(2):326-336, 1952.
17. Prasad Jayanti and Sam Toueg. Wakeup under read/write atomicity. In Distributed Algorithms, 4th International Workshop, volume 486 of LNCS, pages 277-288, 1990.
18. Shay Kutten, Rafail Ostrovsky, and Boaz Patt-Shamir. The Las-Vegas processor identity problem (How and when to be unique). Journal of Algorithms, 37(2): 468-494, November 2000.
19. Richard J. Lipton and Arvin Park. The processor identity problem. Information Processing Letters, 36(2):91-94, October 1990.
20. Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, and Paul Vitányi. Randomized naming using wait-free shared variables. Distributed Computing, 11(3):113-124, August 1998.
21. Mojzesz Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes-Rendus du I Congrès de Mathématiciens des Pays Slaves, pages 92-101, Warszawa, 1929.
22. Naoshi Sakamoto. Comparison of initial conditions for distributed algorithms on anonymous networks. In Proc. 18th ACM Symposium on Principles of Distributed Computing, pages 173-179, 1999.
23. Shang-Hua Teng. Space efficient processor identity protocol. Information Processing Letters, 34(3):147-154, April 1990. (Pubitemid 20685899)