Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Concurrent Data Structures., and . PODC, page 151-153. ACM, (2016)On the Cost of Concurrency in Hybrid Transactional Memory., and . CoRR, (2019)The Fence Complexity of Persistent Sets., , and . SSS, volume 14310 of Lecture Notes in Computer Science, page 36-51. Springer, (2023)Performance Anomalies in Concurrent Data Structure Microbenchmarks., and . OPODIS, volume 253 of LIPIcs, page 7:1-7:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)B-slack Trees: Space Efficient B-Trees.. SWAT, volume 8503 of Lecture Notes in Computer Science, page 122-133. Springer, (2014)Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors., and . DISC, volume 91 of LIPIcs, page 4:1-4:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Analysis and Evaluation of Non-Blocking Interpolation Search Trees., , and . CoRR, (2020)Harnessing epoch-based reclamation for efficient range queries., and . PPoPP, page 14-27. ACM, (2018)Are Your Epochs Too Epic? Batch Free Can Be Harmful., , and . CoRR, (2024)B-slack trees: Highly Space Efficient B-trees.. CoRR, (2017)