Conference
CLEANN: Lock-Free Augmented Trees for Low-Dimensional κ-Nearest Neighbor Search
Parallel Cluster-BFS and Applications to Shortest Paths∗
Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract)
FliT: A Library for Simple and Efficient Persistent Algorithms