Published in: LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018)
Aryaz Eghbali and Philipp Woelfel. An Almost Tight RMR Lower Bound for Abortable Test-And-Set. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 21:1-21:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{eghbali_et_al:LIPIcs.DISC.2018.21, author = {Eghbali, Aryaz and Woelfel, Philipp}, title = {{An Almost Tight RMR Lower Bound for Abortable Test-And-Set}}, booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)}, pages = {21:1--21:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-092-7}, ISSN = {1868-8969}, year = {2018}, volume = {121}, editor = {Schmid, Ulrich and Widder, Josef}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.21}, URN = {urn:nbn:de:0030-drops-98103}, doi = {10.4230/LIPIcs.DISC.2018.21}, annote = {Keywords: Abortability, Test-And-Set, Leader Election, Compare-and-Swap, RMR Complexity, Lower Bound} }