%0 Conference Paper %1 conf/opodis/Katzan020 %A Katzan, Daniel %A Morrison, Adam %B OPODIS %D 2020 %E Bramas, Quentin %E Oshman, Rotem %E Romano, Paolo %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 15:1-15:16 %T Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. %U http://dblp.uni-trier.de/db/conf/opodis/opodis2020.html#Katzan020 %V 184 %@ 978-3-95977-176-4

@inproceedings{conf/opodis/Katzan020, added-at = {2021-09-16T00:00:00.000+0200}, author = {Katzan, Daniel and Morrison, Adam}, biburl = {https://www.bibsonomy.org/bibtex/2250e9ec4d09e7bd441fd26c0eee6101d/dblp}, booktitle = {OPODIS}, crossref = {conf/opodis/2020}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, ee = {https://doi.org/10.4230/LIPIcs.OPODIS.2020.15}, interhash = {a3f4af516b8f1e396200e04d24e7c838}, intrahash = {250e9ec4d09e7bd441fd26c0eee6101d}, isbn = {978-3-95977-176-4}, keywords = {dblp}, pages = {15:1-15:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-09T21:37:22.000+0200}, title = {Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity.}, url = {http://dblp.uni-trier.de/db/conf/opodis/opodis2020.html#Katzan020}, volume = 184, year = 2020 }