Confluently Persistent Tries for Efficient Version Control

DOI10.1007/978-3-540-69903-3_16zbMath1155.68372OpenAlexW1578070726MaRDI QIDQ3512456

Eric Price, Stefan Langerman, Erik D. Demaine

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_16

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Space-efficient functional offline-partially-persistent trees with applications to planar point location

Uses Software

• Subversion

Cites Work

• Making data structures persistent
• A data structure for dynamic trees
• Biased Search Trees
• Making data structures confluently persistent
• Dynamic Models for File Sizes and Double Pareto Distributions
• Purely Functional Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Confluently Persistent Tries for Efficient Version Control