Z. Aghazadeh and P. Woelfel, Upper Bounds for Boundless Tagging with Bounded Objects, Proc. of 30th DISC, pp.442-457, 2016.
DOI : 10.1145/378580.378611

D. Alistarh and J. Aspnes, Sub-logarithmic Test-and-Set against a Weak Adversary, Proc. of 25th DISC, pp.97-109, 2011.
DOI : 10.1007/s004460200071
URL : http://www.cs.yale.edu/homes/aspnes/papers/disc2011-proceedings-oblivious-tas.pdf

J. Anderson and Y. Kim, Adaptive Mutual Exclusion with Local Spinning, Proc. of 14th DISC, pp.29-43, 2000.
DOI : 10.1007/3-540-40026-5_2

J. Anderson and Y. Kim, An improved lower bound for the time complexity of mutual exclusion, Distributed Computing, vol.15, issue.4, pp.221-253, 2002.
DOI : 10.1007/s00446-002-0084-2

J. Anderson, Y. Kim, and T. Herman, Shared-memory mutual exclusion: major research trends since 1986, Distributed Computing, vol.16, issue.2-3, pp.75-110, 2003.
DOI : 10.1007/s00446-003-0088-6

T. Anderson, The performance of spin lock alternatives for shared-money multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.1, pp.6-16, 1990.
DOI : 10.1109/71.80120

J. Aspnes, Faster randomized consensus with an oblivious adversary, Proc. of 31st PODC, pp.1-8, 2012.
DOI : 10.1007/s00446-013-0195-y

H. Attiya, D. Hendler, and S. Levy, An O(1)-barriers optimal RMRs mutual exclusion algorithm, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.220-229, 2013.
DOI : 10.1145/2484239.2484255

H. Attiya, D. Hendler, and P. Woelfel, Tight RMR Lower Bounds for Mutual Exclusion and Other Problems, Proc. of 40th ACM STOC, pp.217-226, 2008.
DOI : 10.1145/1374376.1374410
URL : http://pages.cpsc.ucalgary.ca/~woelfel/paper/MutEX-Lower-Bound/paper.pdf

H. Attiya, D. Hendler, and P. Woelfel, Trading Fences with RMRs and Separating Memory Models, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.173-182, 2015.
DOI : 10.1007/BF01784242

O. Ben-baruch and D. Hendler, The Price of being Adaptive, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.183-192, 2015.
DOI : 10.1007/BF01784242

M. Bender and S. Gilbert, Mutual Exclusion with O(log^2 Log n) Amortized Work, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.728-737, 2011.
DOI : 10.1109/FOCS.2011.84

D. Culler, J. P. Singh, and A. Gupta, Parallel Computer Architecture: A Hardware/Software Approach, 1998.

R. Danek and W. Golab, Closing the complexity gap between FCFS mutual exclusion and mutual exclusion, Distributed Computing, vol.2, issue.3, pp.87-111, 2010.
DOI : 10.1007/s00446-010-0096-2

R. Danek and H. Lee, Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems, Proc. of 22nd DISC, pp.512-513, 2008.
DOI : 10.1007/978-3-540-87779-0_41

O. Denysyuk and P. Woelfel, Are Shared Objects Composable under an Oblivious Adversary?, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, pp.335-344, 2016.
DOI : 10.1109/ICDCS.2003.1203503

E. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, vol.8, issue.9, p.569, 1965.
DOI : 10.1145/365559.365617

G. Giakkoupis and P. Woelfel, On the time and space complexity of randomized test-and-set, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.19-28, 2012.
DOI : 10.1145/2332432.2332436
URL : https://hal.archives-ouvertes.fr/hal-00722947

G. Giakkoupis and P. Woelfel, A tight RMR lower bound for randomized mutual exclusion, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.983-1002, 2012.
DOI : 10.1145/2213977.2214066
URL : https://hal.archives-ouvertes.fr/hal-00722940

G. Giakkoupis and P. Woelfel, Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp.504-513, 2014.
DOI : 10.1109/FOCS.2014.60
URL : https://hal.archives-ouvertes.fr/hal-01097144

W. Golab, V. Hadzilacos, D. Hendler, and P. Woelfel, RMR-efficient implementations of comparison primitives using read and write operations, Distributed Computing, vol.9, issue.1, pp.109-162, 2012.
DOI : 10.1007/BF01784242

W. Golab, L. Higham, and P. Woelfel, Linearizable implementations do not suffice for randomized distributed computation, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.373-382, 2011.
DOI : 10.1145/1993636.1993687
URL : http://arxiv.org/pdf/1103.4690.pdf

D. Hendler and P. Woelfel, Adaptive randomized mutual exclusion in sub-logarithmic expected time, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.141-150, 2010.
DOI : 10.1145/1835698.1835737

D. Hendler and P. Woelfel, Randomized mutual exclusion with sub-logarithmic RMR-complexity, Distributed Computing, vol.9, issue.1, pp.3-19, 2011.
DOI : 10.1007/BF01784242
URL : http://www.cs.bgu.ac.il/%7Ehendlerd/papers/RandomizedMutex.pdf

M. Herlihy and N. Shavit, The art of multiprocessor programming, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, 2008.
DOI : 10.1145/1146381.1146382

P. Jayanti, Adaptive and efficient abortable mutual exclusion, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, pp.295-304, 2003.
DOI : 10.1145/872035.872079

P. Jayanti, S. Petrovic, and N. Narula, Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion, Proc. of 31st SOFSEM, pp.209-218, 2005.
DOI : 10.1007/978-3-540-30577-4_24

Y. Kim and J. Anderson, A Time Complexity Bound for Adaptive Mutual Exclusion, Proc. of 15th DISC, pp.1-15, 2001.
DOI : 10.1007/3-540-45414-4_1
URL : http://cs.unc.edu/~anderson/papers/disc01.ps

Y. Kim and J. Anderson, Nonatomic mutual exclusion with local spinning, Distributed Computing, vol.9, issue.1, pp.19-61, 2006.
DOI : 10.1109/2.55501
URL : http://cs.unc.edu/~anderson/papers/podc02.ps

H. Lee, Transformations of Mutual Exclusion Algorithms from the Cache-Coherent Model to the Distributed Shared Memory Model, Proc. of 25th ICDCS, pp.261-270, 2005.

H. Lee, Fast Local-Spin Abortable Mutual Exclusion with Bounded Space, Proc. of 14th OPODIS, pp.364-379, 2010.
DOI : 10.1145/224964.224988

M. John, M. L. Mellor-crummey, and . Scott, Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Trans. Comput. Syst, vol.9, issue.1, pp.21-65, 1991.

A. Pareek and P. Woelfel, RMR-Efficient Randomized Abortable Mutual Exclusion, Proc. of 26th DISC, pp.267-281, 2012.
DOI : 10.1007/978-3-642-33651-5_19
URL : http://arxiv.org/pdf/1208.1723.pdf

M. Raynal, Algorithms for Mutual Exclusion, 1986.
URL : https://hal.archives-ouvertes.fr/inria-00075216

L. Michael and . Scott, Non-blocking timeout in scalable queue-based spin locks, Proc. of 21st PODC, pp.31-40, 2002.

J. Yang and J. Anderson, A fast, scalable mutual exclusion algorithm, Distributed Computing, vol.9, issue.1, pp.51-60, 1995.
DOI : 10.1109/2.55501
URL : http://www.cs.unc.edu/~anderson/papers/dc95.ps