Retroactive data structures

DOI10.1145/1240233.1240236MaRDI QIDQ2944550zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Erik D. Demaine, John Iacono, Stefan Langerman

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1240233.1240236

zbMATH Keywords

historypersistencepoint locationrollbacktime travel

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 6469156
• Polylogarithmic fully retroactive priority queues via hierarchical checkpointing
• Nearly optimal separation between partially and fully retroactive data structures
• Making data structures persistent
• Efficient uses of the past

Cited in

(6)

• Polylogarithmic fully retroactive priority queues via hierarchical checkpointing
• Nearly optimal separation between partially and fully retroactive data structures
• Anti-persistence
• scientific article; zbMATH DE number 6469156 (Why is no real title available?)
• Buffered partially-persistent external-memory search trees
• Upper and lower bounds for fully retroactive graph problems

This page was built for publication: Retroactive data structures

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