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

An Asynchronous Computability Theorem for Fair Adversaries., , and . PODC, page 387-396. ACM, (2018)Relating LL-Resilience and Wait-Freedom via Hitting Sets., and . ICDCN, volume 6522 of Lecture Notes in Computer Science, page 191-202. Springer, (2011)Grasping the Gap Between Blocking and Non-Blocking Transactional Memories., and . DISC, volume 9363 of Lecture Notes in Computer Science, page 232-247. Springer, (2015)Inherent Limitations of Hybrid Transactional Memory., , , , and . DISC, volume 9363 of Lecture Notes in Computer Science, page 185-199. Springer, (2015)On Set Consensus Numbers., and . DISC, volume 5805 of Lecture Notes in Computer Science, page 35-47. Springer, (2009)Flat Parallelization., and . CoRR, (2017)Why Transactional Memory Should Not Be Obstruction-Free., and . CoRR, (2015)WTTM 2011: the third workshop on the theory of transactional memory., and . SIGACT News, 43 (1): 87-92 (2012)Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup., , and . PODC, page 103-105. ACM, (2022)Task Computability in Unreliable Anonymous Networks., and . OPODIS, volume 125 of LIPIcs, page 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)