Author of the publication

Lower Bound on the Step Complexity of Anonymous Binary Consensus.

, , and . DISC, volume 9888 of Lecture Notes in Computer Science, page 257-268. Springer, (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

Lower Bounds on the Amortized Time Complexity of Shared Objects., and . OPODIS, volume 95 of LIPIcs, page 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Remote Memory References at Block Granularity., and . OPODIS, volume 95 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Editorial: Special issue of PODC 2017 and DISC 2017.. Distributed Comput., 33 (3): 207 (2020)Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs., , and . CoRR, (2021)2021 Principles of Distributed Computing Doctoral Dissertation Award., , , and . PODC, page 3. ACM, (2021)Staleness and Local Progress in Transactional Memory., , , and . NETYS, volume 12129 of Lecture Notes in Computer Science, page 227-243. Springer, (2020)Randomized consensus in expected O(n log n) individual work., , and . PODC, page 325-334. ACM, (2008)Local Labeling and Resource Allocation Using Preprocessing., , and . WDAG, volume 857 of Lecture Notes in Computer Science, page 194-208. Springer, (1994)Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract)., , and . WDAG, volume 647 of Lecture Notes in Computer Science, page 35-53. Springer, (1992)Special issue on PODC 2015 and PODC 2016.. Distributed Comput., 32 (6): 459 (2019)