Author:
Angluin Dana,Aspnes James,Eisenstat David
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference28 articles.
1. Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S., Spirakis, P., Welsh, M. (eds.) Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June/July, 2005, Proceedings, vol. 3560 of Lecture Notes in Computer Science, pp. 63–74. Springer-Verlag, June 2005
2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science, November (2003)
3. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC ’04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 290–299. ACM Press (2004)
4. Angluin D., Aspnes J., Diamadi Z., Fischer M.J., Peralta R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)
5. Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Distributed Computing: 20th International Symposium, DISC 2006: Stockholm, Sweden, September 2006: Proceedings, pp. 61–75 (2006)
Cited by
112 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Dynamic Size Counting in the Population Protocol Model;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. Game Dynamics and Equilibrium Computation in the Population Protocol Model;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
3. Fast and succinct population protocols for Presburger arithmetic;Journal of Computer and System Sciences;2024-03
4. Rate-Independent Continuous Inhibitory Chemical Reaction Networks Are Turing-Universal;Lecture Notes in Computer Science;2024
5. Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16