Author:
Afek Yehuda,Babichenko Yakov,Feige Uriel,Gafni Eli,Linial Nati,Sudakov Benny
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In: FOCS, pp. 218–223 (1979)
2. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524–548 (1990)
3. Anderson, R.J., Woll, H.: Algorithms for the Certified Write-All Problem. SIAM J. Comput. 26(5), 1277–1283 (1997)
4. Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic Snapshots of Shared Memory. Journal of the ACM 40(4), 873–890 (1993)
5. Afek, Y., Babichenko, Y., Feige, U., Gafni, E., Linial, N., Sudakov, B.: Oblivious Collaboration (ArXiv version of current paper.), http://arxiv.org/abs/1106.2065
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Communication Pattern Logic: Epistemic and Topological Views;Journal of Philosophical Logic;2023-07-28
2. Brief Announcement;Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing;2016-07-25
3. Asynchronous Coordination Under Preferences and Constraints;Structural Information and Communication Complexity;2016
4. Musical Chairs;SIAM Journal on Discrete Mathematics;2014-01