Presents a space-efficient lock-free linear-probing hash table with wait-free lookups, linearizable operations, and amortized complexity matching sequential linear probing under no concurrent same-key insertions.
Efficient and practical constructions of ll/sc variables
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Space-Efficient Lock-Free Linear-Probing Hash Table
Presents a space-efficient lock-free linear-probing hash table with wait-free lookups, linearizable operations, and amortized complexity matching sequential linear probing under no concurrent same-key insertions.