Efficient pebbling for list traversal synopses with application to program rollback

DOI10.1016/j.tcs.2007.02.048zbMath1121.68032OpenAlexW2036247450MaRDI QIDQ2373729

Yossi Matias, Ely Porat

Publication date: 16 July 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.048

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• A bounded-space tree traversal algorithm
• Fast and read-only algorithms for traversing trees without an auxiliary stack
• Almost Optimal Hash Sequence Traversal
• Advances in Cryptology - EUROCRYPT 2004
• Recycling continuations
• An efficient machine-independent procedure for garbage collection in various list structures
• Backing up in singly linked lists
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient pebbling for list traversal synopses with application to program rollback