Journal Article
FliT: A Library for Simple and Efficient Persistent Algorithms
FliT: A Library for Simple and Efficient Persistent Algorithms
Parallel Minimum Cuts in <i>O</i> (<i>m</i> log<SUP>2</SUP> <i>n</i>) Work and Low Depth
SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS
NVTraverse: In NVRAM Data Structures, the Destination Is More Important Than the Journey