scientific article; zbMATH DE number 140490

zbMATH Open0767.68060MaRDI QIDQ4028909FDOQ4028909

Authors: N. Nishimura 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

NP-completedirected acyclic graphsversion controlprogram trees

Mathematics Subject Classification ID

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

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)