Confluently persistent tries for efficient version control
From MaRDI portal
Publication:970608
Recommendations
Cites work
- scientific article; zbMATH DE number 6381684 (Why is no real title available?)
- scientific article; zbMATH DE number 4211552 (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?)
- scientific article; zbMATH DE number 2079361 (Why is no real title available?)
- A data structure for dynamic trees
- Alternatives to splay trees with O( n) worst-case access times
- Biased Search Trees
- Dynamic Models for File Sizes and Double Pareto Distributions
- Introduction to algorithms
- Making data structures confluently persistent
- Making data structures persistent
- Purely Functional Data Structures
- Subversion
Cited in
(9)- Confluent persistence revisited
- Making data structures confluently persistent. (Extended abstract)
- scientific article; zbMATH DE number 140490 (Why is no real title available?)
- Versioning Tree Structures by Path-Merging
- Confluently Persistent Tries for Efficient Version Control
- Blame trees
- Multi-Finger Binary Search Trees
- Making data structures confluently persistent
- Fully persistent B-trees
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 Q970608)
