Making data structures confluently persistent

DOI10.1016/S0196-6774(03)00044-0zbMath1078.68021OpenAlexW3138411056MaRDI QIDQ4458871

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)

Related Items (4)

Upper and lower bounds for fully retroactive graph problems ⋮ Confluently Persistent Tries for Efficient Version Control ⋮ Confluently persistent tries for efficient version control ⋮ Unnamed Item

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