Confluently Persistent Tries for Efficient Version Control

DOI10.1007/978-3-540-69903-3_16MaRDI QIDQ3512456zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Stefan Langerman, Eric Price

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)

Recommendations

• Confluently persistent tries for efficient version control
• Making data structures confluently persistent. (Extended abstract)
• Confluent persistence revisited
• Making data structures confluently persistent
• scientific article; zbMATH DE number 140490

Cites work

• A data structure for dynamic trees
• Biased Search Trees
• Dynamic Models for File Sizes and Double Pareto Distributions
• scientific article; zbMATH DE number 6381684 (Why is no real title available?)
• scientific article; zbMATH DE number 140460 (Why is no real title available?)
• scientific article; zbMATH DE number 1263185 (Why is no real title available?)
• Making data structures confluently persistent
• Making data structures persistent
• Purely Functional Data Structures

Cited in

(8)

• Efficient versioning for matrix structures
• Making data structures confluently persistent. (Extended abstract)
• Blame trees
• Versioning Tree Structures by Path-Merging
• scientific article; zbMATH DE number 140490 (Why is no real title available?)
• Confluent persistence revisited
• Space-efficient functional offline-partially-persistent trees with applications to planar point location
• Confluently persistent tries for efficient version control

Describes a project that uses

Uses Software

• Subversion

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

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