Simple confluently persistent catenable lists

DOI10.1007/BFB0054360MaRDI QIDQ5054848zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Chris Okasaki, Robert E. 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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Simple Confluently Persistent Catenable Lists
• scientific article; zbMATH DE number 1256736
• scientific article; zbMATH DE number 1263185
• Recursive categoricity and persistence
• scientific article; zbMATH DE number 1953111
• Simple extensions of combinatorial structures
• Categorial graphs
• Persistence Over Posets
• Confluent persistence revisited

Cites work

• Amortized Computational Complexity
• Confluently Persistent Deques via Data-Structural Bootstrapping
• Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
• scientific article; zbMATH DE number 140460 (Why is no real title available?)
• scientific article; zbMATH DE number 1256736 (Why is no real title available?)
• scientific article; zbMATH DE number 1263185 (Why is no real title available?)
• scientific article; zbMATH DE number 1306897 (Why is no real title available?)
• scientific article; zbMATH DE number 1003250 (Why is no real title available?)
• Making data structures persistent
• The role of lazy evaluation in amortized data structures

Cited in

(3)

• Simple Confluently Persistent Catenable Lists
• Confluently Persistent Deques via Data-Structural Bootstrapping
• Lists revisited, cache-conscious STL lists

This page was built for publication: Simple confluently persistent catenable lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054848)