 The Fence Complexity of Persistent SetsSafety-critical Systems Symposium (SSS), 2023 |
 Recoverable and Detectable Self-Implementations of SwapInternational Conference on Principles of Distributed Systems (OPODIS), 2023 |
 Transactional Composition of Nonblocking Data StructuresACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), 2023 |
 When Is Recoverable Consensus Harder Than Consensus?ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Turning Manual Concurrent Memory Reclamation into Automatic Reference
CountingACM-SIGPLAN Symposium on Programming Language Design and Implementation (PLDI), 2022 |
 Elimination (a,b)-trees with fast, durable updatesACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), 2021 |
 FliT: A Library for Simple and Efficient Persistent AlgorithmsACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), 2021 |
 Execution of NVRAM Programs with Persistent StackInternational Conference on Parallel Architectures and Compilation Techniques (PACT), 2021 |
 Fast Nonblocking Persistence for Concurrent Data StructuresInternational Symposium on Distributed Computing (DISC), 2021 |
 Durable Queues: The Second AmendmentACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021 |
