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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Any n-qubit QC Hamiltonian sparsifies to Õ(n/ε²) terms preserving all state energies within 1±ε using invariant subspace decomposition and the Alon-Kozma operator inequality.
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.
-
Quantum Cut Sparsifiers
Any n-qubit QC Hamiltonian sparsifies to Õ(n/ε²) terms preserving all state energies within 1±ε using invariant subspace decomposition and the Alon-Kozma operator inequality.