scientific article; zbMATH DE number 140490

MaRDI QIDQ4028909zbMATH OpenFDO

Authors N. Nishimura

Publication date 28 March 1993

zbMATH Keywords

NP-completedirected acyclic graphsversion controlprogram trees

Mathematics Subject Classification ID

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

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

(3)

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

This page was built for publication:

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