Author of the publication

Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers.

, , , and . CoRR, (2024)

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

Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks., and . OPODIS, volume 5401 of Lecture Notes in Computer Science, page 164-183. Springer, (2008)Inherent limitations on disjoint-access parallel implementations of transactional memory., , and . SPAA, page 69-78. ACM, (2009)Long-lived counters with polylogarithmic amortized step complexity., , , and . Distributed Comput., 36 (1): 29-43 (March 2023)The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost., , , and . Theor. Comput. Sci., 412 (12-14): 1066-1080 (2011)Byzantine Auditable Atomic Register with Optimal Resilience., , and . SRDS, page 121-132. IEEE, (2022)Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism., , , , and . CoRR, (2011)Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony., , , and . Distributed Comput., 25 (4): 279-296 (2012)A Faster Counting Protocol for Anonymous Dynamic Networks., and . OPODIS, volume 46 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Synchronization Power of Auditable Registers., , , , and . OPODIS, volume 286 of LIPIcs, page 4:1-4:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Upper and Lower Bounds for Deterministic Approximate Objects., , , and . ICDCS, page 438-448. IEEE, (2021)