1. Universal constructions for multi-object operations
2. Maya Arbel-Raviv and Trevor Brown . 2017 . Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors . In Proceedings of the 31st ACM Symposium on Distributed Computing. Maya Arbel-Raviv and Trevor Brown. 2017. Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors. In Proceedings of the 31st ACM Symposium on Distributed Computing.
3. Maya Arbel-Raviv , Trevor Brown , and Adam Morrison . 2018 . Getting to the Root of Concurrent Binary Search Tree Performance . In 2018 USENIX Annual Technical Conference (USENIX ATC 18) . USENIX Association, Boston, MA, 295--306. https://www.usenix.org/conference/atc18/presentation/arbel-raviv Maya Arbel-Raviv, Trevor Brown, and Adam Morrison. 2018. Getting to the Root of Concurrent Binary Search Tree Performance. In 2018 USENIX Annual Technical Conference (USENIX ATC 18). USENIX Association, Boston, MA, 295--306. https://www.usenix.org/conference/atc18/presentation/arbel-raviv
4. Luc Bougé , Joaquim Gabarró Vallés , Xavier Messeguer Peypoch, and Nicolas Schabanel. 1998 . Height-relaxed AVL rebalancing: a unified, fine-grained approach to concurrent dictionaries. Luc Bougé, Joaquim Gabarró Vallés, Xavier Messeguer Peypoch, and Nicolas Schabanel. 1998. Height-relaxed AVL rebalancing: a unified, fine-grained approach to concurrent dictionaries.
5. A practical concurrent binary search tree