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