Making data structures confluently persistent

DOI10.1016/S0196-6774(03)00044-0MaRDI QIDQ4458871zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Amos Fiat

Publication date 14 March 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00044-0

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Making data structures confluently persistent. (Extended abstract)
• Confluently Persistent Deques via Data-Structural Bootstrapping
• Confluent persistence revisited
• Making data structures persistent
• Confluently persistent tries for efficient version control

Cited in

(11)

• Confluent persistence revisited
• Upper and lower bounds for fully retroactive graph problems
• Confluently persistent tries for efficient version control
• scientific article; zbMATH DE number 437540 (Why is no real title available?)
• Making data structures confluently persistent. (Extended abstract)
• Confluently Persistent Tries for Efficient Version Control
• Making data structures persistent
• Anti-persistence
• Semi-persistent Data Structures
• Cache-oblivious persistence
• scientific article; zbMATH DE number 140460 (Why is no real title available?)

This page was built for publication: Making data structures confluently persistent

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