History-independent concurrent objects
From MaRDI portal
Cites work
- Advances in Cryptology - CRYPTO 2003
- Anti-persistence
- B-Treaps: A Uniquely Represented Alternative to B-Trees
- Characterizing history independent data structures
- Converting Lamport's regular register to atomic register
- Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
- Disjoint-access-parallel implementations of strong shared memory primitives
- Dynamizing static algorithms, with applications to dynamic trees and history independence
- History-Independent Cuckoo Hashing
- scientific article; zbMATH DE number 1979502 (Why is no real title available?)
- scientific article; zbMATH DE number 1559561 (Why is no real title available?)
- MAX registers, counters, and monotone circuits
- New Tight Bounds on Uniquely Represented Dictionaries
- Online list labeling: breaking the ^2 n barrier
- Ordered hash tables
This page was built for publication: History-independent concurrent objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971989)