Author of the publication

The space complexity of long-lived and one-shot timestamp implementations.

, , , and . PODC, page 139-148. ACM, (2011)

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

The Space Complexity of Distributed Tasks in the Shared Memory Model.. University of Calgary, Alberta, Canada, (2016)base-search.net (ftunivcalgary:oai:prism.ucalgary.ca:11023/3071).An empirical investigation into application of a fast discrete 2D S-transform algorithm to provide localized measures of texture in images., , , and . CCECE, page 201-204. IEEE, (2011)A review of PODC 2011.. SIGACT News, 42 (4): 83-86 (2011)Test-and-Set in Optimal Space., , , and . STOC, page 615-623. ACM, (2015)Space Bounds for Adaptive Renaming., , and . DISC, volume 8784 of Lecture Notes in Computer Science, page 303-317. Springer, (2014)Strongly linearizable implementations: possibilities and impossibilities., , and . PODC, page 385-394. ACM, (2012)The space complexity of long-lived and one-shot timestamp implementations., , , and . PODC, page 139-148. ACM, (2011)An O(sqrt n) Space Bound for Obstruction-Free Leader Election., , , and . DISC, volume 8205 of Lecture Notes in Computer Science, page 46-60. Springer, (2013)