Author of the publication

A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms.

, , and . OPODIS, volume 46 of LIPIcs, page 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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

Verifying linearizability with hindsight., , , , and . PODC, page 85-94. ACM, (2010)Brief announcement: concurrency-aware linearizability., and . PODC, page 209-211. ACM, (2014)Chopped symbolic execution., , , and . ICSE, page 350-360. ACM, (2018)A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms., , and . OPODIS, volume 46 of LIPIcs, page 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Sequential verification of serializability., , and . POPL, page 31-42. ACM, (2010)Towards Hypothetical Reasoning Using Distributed Provenance., , , and . EDBT, page 461-464. OpenProceedings.org, (2018)State Merging with Quantifiers in Symbolic Execution., , , and . ESEC/SIGSOFT FSE, page 1140-1152. ACM, (2023)Hypothetical Reasoning via Provenance Abstraction., , and . SIGMOD Conference, page 537-554. ACM, (2019)Verifying Concurrent Memory Reclamation Algorithms with Grace., , and . ESOP, volume 7792 of Lecture Notes in Computer Science, page 249-269. Springer, (2013)Online detection of effectively callback free objects with applications to smart contracts., , , , , , and . Proc. ACM Program. Lang., 2 (POPL): 48:1-48:28 (2018)