Tight Bounds on Online Checkpointing Algorithms
From MaRDI portal
Publication:4987449
Recommendations
- Tight bounds on online checkpointing algorithms
- Approximately uniform online checkpointing with bounded memory
- New algorithms for optimal online checkpointing
- Approximately uniform online checkpointing
- The complexity of online memory checking
- On-line algorithms for locating checkpoints
- Stronger lower bounds for online ORAM
Cited in
(4)
This page was built for publication: Tight Bounds on Online Checkpointing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987449)