1. Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proc. 27th ACM Symposium on Theory of Computing, pages 538–547, (1995)
2. Asbell, S., Ruppert, E.: A wait-free deque with polylogarithmic step complexity. In: Proc. 27th International Conference on Principles of Distributed Computing, pages 17:1–17:22, (2023)
3. Attiya, H., Fouren, A.: Lower bounds on the amortized time complexity of shared objects. In: 21st International Conference on Principles of Distributed Systems, volume 95 of LIPIcs, pages 16:1–16:18, (2017)
4. Bashari, B., Woelfel, P.: An efficient adaptive partial snapshot implementation. In: Proc. ACM Symposium on Principles of Distributed Computing, pages 545–555 (2021)
5. Ben-David, N., Blelloch, G.E., Fatourou, P., Ruppert, E., Sun, Y., Wei, Y.: Space and time bounded multiversion garbage collection. In Proc. 35th International Symposium on Distributed Computing, volume 209 of LIPIcs, pages 12:1–12:20 (2021)