Backing up in singly linked lists

DOI10.1145/301250.301450MaRDI QIDQ5890871zbMATH OpenOpenAlexFDO

Authors Holger Petersen, Amir M. Ben-Amram

Publication date 29 September 2016

Published in Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Backing up in singly linked lists
• scientific article; zbMATH DE number 2038764
• Efficient pebbling for list traversal synopses with application to program rollback
• scientific article; zbMATH DE number 17818
• Worst-case analysis of the set-union problem with extended backtracking

Cited in

(3)

• Efficient pebbling for list traversal synopses with application to program rollback
• scientific article; zbMATH DE number 2038764 (Why is no real title available?)
• Backing up in singly linked lists

This page was built for publication: Backing up in singly linked lists

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