Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model - researchr publication related

researchr

You are not signed in
Sign in
Sign up

George Giakkoupis, Philipp Woelfel. Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. In Elad Michael Schiller, Alexander A. Schwarzmann, editors, Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017. pages 221-229, ACM, 2017. [doi]

The following publications are possibly variants of this publication:

Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSMGeorge Giakkoupis, Philipp Woelfel. focs 2014: 504-513 [doi]

Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard PrimitivesDavid Yu Cheng Chan, Philipp Woelfel. podc 2020: 181-190 [doi]

RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract)Abhijeet Pareek, Philipp Woelfel. wdag 2012: 267-281 [doi]

Randomized mutual exclusion with sub-logarithmic RMR-complexityDanny Hendler, Philipp Woelfel. dc, 24(1):3-19, 2011. [doi]

A tight RMR lower bound for randomized mutual exclusionGeorge Giakkoupis, Philipp Woelfel. stoc 2012: 983-1002 [doi]

Tight Lower Bound for the RMR Complexity of Recoverable Mutual ExclusionDavid Yu Cheng Chan, Philipp Woelfel. podc 2021: 533-543 [doi]

Brief announcement: a tight RMR lower bound for randomized mutual exclusionGeorge Giakkoupis, Philipp Woelfel. podc 2012: 239-240 [doi]

runs on WebDSL