Author:
Attiya Hagit,Fouren Arie,Ko Jeremy
Funder
Israel Science Foundation
Ono Academic College Research Fund
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Reference26 articles.
1. Anderson, J.H., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput. 16(2), 75–110 (2003)
2. Anderson, J.H., Moir, M.: Universal constructions for multi-object operations. In Proceedings of the 14th annual ACM symposium on Principles of Distributed Computing, pp. 184–193, (1995)
3. Anderson, R.J., Woll, H.: Wait-free parallel algorithms for the union-find problem. In Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, STOC ’91, pp. 370–380, (1991)
4. Asbell, S.M., Ruppert, E.: A wait-free deque with polylogarithmic step complexity. In 27th International Conference on Principles of Distributed Systems, OPODIS 2023, vol. 286, pp. 17:1–17:22, (2023)
5. Attiya, H., Fouren, A.: Poly-logarithmic adaptive algorithms require revealing primitives. J. Parallel Distrib. Comput. 109, 102–116 (2017)