1. Vitaly Aksenov , Dan Alistarh , Alexandra Drozdova , and Amirkeivan Mohtashami . 2020. The splay-list: A distribution-adaptive concurrent skip-list. arXiv preprint arXiv:2008.01009 ( 2020 ). Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. 2020. The splay-list: A distribution-adaptive concurrent skip-list. arXiv preprint arXiv:2008.01009 (2020).
2. Dan Alistarh , Patrick Eugster , Maurice Herlihy , Alexander Matveev , and Nir Shavit . 2014 . Stacktrack: An automated transactional approach to concurrent memory reclamation . In Proceedings of the Ninth European Conference on Computer Systems. 1--14 . Dan Alistarh, Patrick Eugster, Maurice Herlihy, Alexander Matveev, and Nir Shavit. 2014. Stacktrack: An automated transactional approach to concurrent memory reclamation. In Proceedings of the Ninth European Conference on Computer Systems. 1--14.
3. Threadscan: Automatic and scalable memory reclamation;Alistarh Dan;ACM Transactions on Parallel Computing (TOPC),2018
4. Hagit Attiya , Ohad Ben-Baruch , and Danny Hendler . 2018 . Nesting-safe recoverable linearizability: Modular constructions for non-volatile memory . In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. 7--16 . Hagit Attiya, Ohad Ben-Baruch, and Danny Hendler. 2018. Nesting-safe recoverable linearizability: Modular constructions for non-volatile memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. 7--16.
5. Oana Balmau , Rachid Guerraoui , Maurice Herlihy , and Igor Zablotchi . 2016 . Fast and robust memory reclamation for concurrent data structures . In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. 349--359 . Oana Balmau, Rachid Guerraoui, Maurice Herlihy, and Igor Zablotchi. 2016. Fast and robust memory reclamation for concurrent data structures. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. 349--359.