Fast and Theoretically Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps

Quinten De Man, Laxman Dhulipala. Fast and Theoretically Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps. In Julian Shun, Rezaul Alam Chowdhury, editors, Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2026, Royal Holloway, University of London, London, United Kingdom, July 6-10, 2026. pages 234-246, ACM, 2026. [doi]

Abstract

Abstract is missing.