Efficient pebbling for list traversal synopses with application to program rollback
From MaRDI portal
Publication:2373729
Recommendations
Cites work
- A bounded-space tree traversal algorithm
- Advances in Cryptology - EUROCRYPT 2004
- Alias types for recursive data structures
- Almost optimal hash sequence traversal
- An efficient machine-independent procedure for garbage collection in various list structures
- Backing up in singly linked lists
- Efficient pebbling for list traversal synopses
- Fast and read-only algorithms for traversing trees without an auxiliary stack
- Forward-secure signatures with fast key update
- Fractal Merkle tree representation and traversal
- scientific article; zbMATH DE number 3765164 (Why is no real title available?)
- scientific article; zbMATH DE number 1305513 (Why is no real title available?)
- scientific article; zbMATH DE number 1775412 (Why is no real title available?)
- scientific article; zbMATH DE number 2119721 (Why is no real title available?)
- On the computation-storage trade-offs of hash chain traversal
- Recycling continuations
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)