Z. Aghazadeh, W. Golab, and P. Woelfel, Making objects writable, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14, pp.385-395, 2014.
DOI : 10.1145/2611462.2611483

D. Alistarh and J. Aspnes, Sub-logarithmic Test-and-Set against a Weak Adversary, Proc. 25th DISC, pp.97-109, 2011.
DOI : 10.1007/s004460200071
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.604

J. Anderson, Y. Kim, and T. Herman, Shared-memory mutual exclusion: major research trends since 1986, Distributed Computing, pp.75-110, 2003.
DOI : 10.1007/s00446-003-0088-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.1589

J. Anderson and Y. Kim, Fast and Scalable Mutual Exclusion, Proc. 13th DISC, pp.180-194, 1999.
DOI : 10.1007/3-540-48169-9_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3306

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. 31st PODC, pp.1-8, 2012.

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. 40th STOC, pp.217-226, 2008.

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. Singh, and A. Gupta, Parallel Computer Architecture: A Hardware/Software Approach The communication requirements of mutual exclusion, [13] R. Cypher Proc. 7th SPAA, pp.147-156, 1995.

R. Danek and W. Golab, Closing the complexity gap between FCFS mutual exclusion and mutual exclusion, Distributed Computing, pp.87-111, 2010.

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

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

R. Fan and N. Lynch, ) lower bound on the cost of mutual exclusion, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.275-284, 2006.
DOI : 10.1145/1146381.1146423

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

W. Golab, V. Hadzilacos, D. Hendler, and P. Woelfel, RMRefficient implementations of comparison primitives using read and write operations, Distributed Computing, pp.109-162, 2012.

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

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

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 fastpath transformation for FCFS mutual exclusion, Proc. 31st SOFSEM, pp.209-218, 2005.

Y. Kim and J. Anderson, A time complexity bound for adaptive mutual exclusion, Proc. 15th DISC, pp.1-15, 2001.

H. Lee, Transformations of mutual exclusion algorithms from the cache-coherent model to the distributed shared memory model, Proc. 25th ICDCS, pp.261-270, 2005.

N. Lynch, Distributed Algorithms, 1996.

J. Mellor-crummey and M. Scott, Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Transactions on Computer Systems, vol.9, issue.1, pp.21-65, 1991.
DOI : 10.1145/103727.103729

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

J. Yang and J. Anderson, A fast, scalable mutual exclusion algorithm, Distributed Computing, pp.51-60, 1995.
DOI : 10.1007/BF01784242
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.8678