Complexity issues in tree-based version control

DOI10.1007/3-540-51542-9_39MaRDI QIDQ4028909zbMATH OpenFDO

Authors N. Nishimura

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51542-9_39

zbMATH Keywords

directed acyclic graphsNP-completeprogram treesversion control

Mathematics Subject Classification ID

Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Minimizing time-space cost for database version control
• A parallel tree difference algorithm
• Confluently persistent tries for efficient version control
• Confluently Persistent Tries for Efficient Version Control
• An \(O(ND)\) difference algorithm and its variations

Cited in

(4)

• Reading beside the lines: Using indentation to rank revisions by complexity
• Efficient versioning for matrix structures
• Confluently Persistent Tries for Efficient Version Control
• Confluently persistent tries for efficient version control

This page was built for publication: Complexity issues in tree-based version control

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