Author of the publication

Improving Average Performance by Relaxing Distributed Data Structures.

, and . DISC, volume 8784 of Lecture Notes in Computer Science, page 421-438. Springer, (2014)

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

Relaxed Data Types as Consistency Conditions., and . Algorithms, 11 (5): 61 (2018)Anomalies and Similarities Among Consensus Numbers of Variously-Relaxed Queues., and . NETYS, volume 10299 of Lecture Notes in Computer Science, page 191-205. (2017)Generic Proofs of Consensus Numbers for Abstract Data Types., and . OPODIS, volume 46 of LIPIcs, page 32:1-32:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds., and . PODC, page 370-373. ACM, (2023)Anomalies and similarities among consensus numbers of variously-relaxed queues., and . Computing, 101 (9): 1349-1368 (2019)Relaxed Data Types as Consistency Conditions., and . SSS, volume 10616 of Lecture Notes in Computer Science, page 142-156. Springer, (2017)DISC 2014 Review., and . SIGACT News, 45 (4): 94-99 (2014)Improving Average Performance by Relaxing Distributed Data Structures., and . DISC, volume 8784 of Lecture Notes in Computer Science, page 421-438. Springer, (2014)Fast and Space-Efficient Queues via Relaxation., and . OPODIS, volume 184 of LIPIcs, page 14:1-14:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues., and . DISC, volume 281 of LIPIcs, page 34:1-34:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)