Backing up in singly linked lists

DOI10.1145/301250.301450zbMath1346.68072OpenAlexW2063767194MaRDI QIDQ5890871

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

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

Related Items (1)

Efficient pebbling for list traversal synopses with application to program rollback

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