Author of the publication

A Complexity-Based Hierarchy for Multiprocessor Synchronization: Extended Abstract.

, , , and . PODC, page 289-298. ACM, (2016)

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)Tight bounds for anonymous adopt-commit objects., and . SPAA, page 317-324. ACM, (2011)The amortized complexity of non-blocking binary search trees., , , and . PODC, page 332-340. ACM, (2014)Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract).. OPODIS, volume 70 of LIPIcs, page 4:1-4:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Emulating a Shared Register in a System That Never Stops Changing., , , , and . IEEE Trans. Parallel Distributed Syst., 30 (3): 544-559 (2019)Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract)., , , , and . DISC, volume 9363 of Lecture Notes in Computer Science, page 75-91. Springer, (2015)Why extension-based proofs fail., , , , and . STOC, page 986-996. ACM, (2019)Space Lower Bounds for the Signal Detection Problem., , , and . Theory Comput. Syst., 65 (4): 687-705 (2021)The Step Complexity of Multidimensional Approximate Agreement., and . OPODIS, volume 253 of LIPIcs, page 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Wait-Free Approximate Agreement on Graphs., , and . SIROCCO, volume 12810 of Lecture Notes in Computer Science, page 87-105. Springer, (2021)