A New Timestamping Scheme Based on Skip Lists
From MaRDI portal
Recommendations
- A combined BIT and TIMESTAMP algorithm for the list update problem
- A simple, memory-efficient bounded concurrent timestamping algorithm
- Time-stamping with binary linking schemes
- A new look at timestamp ordering concurrency control
- scientific article; zbMATH DE number 1825103
- On optimal hash tree traversal for interval time-stamping
Cited in
(5)- Property-driven timestamps encoding for timeprints-based tracing and monitoring
- Stamp and extend -- instant but undeniable timestamping based on lazy trees
- Distributed time-stamping with boomerang onions
- An everlasting secure non-interactive timestamping scheme in the bounded storage model
- A combined BIT and TIMESTAMP algorithm for the list update problem
This page was built for publication: A New Timestamping Scheme Based on Skip Lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600115)