I love that new, performant data structures are still being found in CS.<p>It's easy to forget that it's still such a new and early field. The modern version of CS started in what... the 50s, earliest? There are many people alive today who are older than the study of CS itself.
Vitaly Aksenov (an author) gave a Google Tech Talk in July: <i>Is it possible to make self-adjusting data structures concurrent?</i>[1].<p>I didn't find paper-associated code. Fwiw, there's an earlier 2020 Aksenov splay-list paper with a repo.[2]<p>Authors' 2024 <i>The Next 700 Benchmarking Frameworks for Concurrent Data Structures</i> is inaccessible (ACM paywall), but 2023 <i>Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures</i>[3] looks cute. Aksenov has a home page[4] with pre-2024 pdfs. I didn't see homes for the other authors.<p>[1] <a href="https://www.youtube.com/watch?v=A7DaSVMm0To" rel="nofollow">https://www.youtube.com/watch?v=A7DaSVMm0To</a>
[2] paper: <a href="https://arxiv.org/pdf/2008.01009" rel="nofollow">https://arxiv.org/pdf/2008.01009</a> unexplored archival repo: <a href="https://cutt.ly/disc2020353" rel="nofollow">https://cutt.ly/disc2020353</a> possibly related: <a href="https://github.com/Aksenov239/splaylist/tree/master/structs_bench">https://github.com/Aksenov239/splaylist/tree/master/structs_...</a>
[3] <a href="https://openaccess.city.ac.uk/id/eprint/31793/1/LIPIcs.DISC.2023.35.pdf" rel="nofollow">https://openaccess.city.ac.uk/id/eprint/31793/1/LIPIcs.DISC....</a>
[4] <a href="https://ctlab.itmo.ru/~vaksenov/" rel="nofollow">https://ctlab.itmo.ru/~vaksenov/</a>