Simple confluently persistent catenable lists
From MaRDI portal
Publication:5054848
DOI10.1007/BFb0054360zbMath1502.68098OpenAlexW1522730861MaRDI QIDQ5054848
Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0054360
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Making data structures persistent
- The role of lazy evaluation in amortized data structures
- Amortized Computational Complexity
- Confluently Persistent Deques via Data-Structural Bootstrapping
- Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
This page was built for publication: Simple confluently persistent catenable lists