Efficient pebbling for list traversal synopses with application to program rollback

DOI10.1016/J.TCS.2007.02.048zbMATH Open1121.68032OpenAlexW2036247450MaRDI QIDQ2373729FDOQ2373729

Authors: Y. 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

Recommendations

• scientific article; zbMATH DE number 2038764
• Explicit optimal binary pebbling for one-way hash chain reversal
• Backing up in singly linked lists
• Backing up in singly linked lists
• Reversible pebble game on trees

Mathematics Subject Classification ID

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

Cites Work

• An efficient machine-independent procedure for garbage collection in various list structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast and read-only algorithms for traversing trees without an auxiliary stack
• A bounded-space tree traversal algorithm
• Advances in Cryptology - EUROCRYPT 2004
• Almost optimal hash sequence traversal
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computation-storage trade-offs of hash chain traversal
• Title not available (Why is that?)
• Recycling continuations
• Backing up in singly linked lists

Cited In (2)

• Backing up in singly linked lists
• Title not available (Why is that?)

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

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