FlintKV delivers a durable linearizable skiplist key-value store with full production API support (atomic batches, snapshot iterators) and reports up to 75% higher end-to-end throughput than prior NVM stores.
InDISC (LNCS), Cyril Gavoille and David Ilcinkas (Eds.), Vol
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Develops an information flow logic for unstructured assembly language and applies reordering interference freedom to persistent memory.
Data-access cost scales as N to the 1/4 in an abstract memory hierarchy for a class of applications.
citing papers explorer
-
The Fourth-Root Complexity of Data Movement
Data-access cost scales as N to the 1/4 in an abstract memory hierarchy for a class of applications.