, Long-lived renaming made adaptive, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, pp.91-103, 1999.
DOI : 10.1145/301308.301335
, -1)-renaming, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, pp.105-112, 1999.
DOI : 10.1145/301308.301338
URL : https://hal.archives-ouvertes.fr/hal-01206577
, Sub-logarithmic Test-and-Set against a Weak Adversary, Proc. of 25th DISC, pp.97-109, 2011.
DOI : 10.1007/s004460200071
, Optimal-time adaptive strong renaming, with applications to counting, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pp.239-248, 2011.
DOI : 10.1145/1993806.1993850
, The Complexity of Renaming, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.718-727, 2011.
DOI : 10.1109/FOCS.2011.66
, Fast Randomized Test-and-Set and Renaming, Proc. of 24th DISC, pp.94-108, 2010.
DOI : 10.1007/978-3-642-15763-9_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.4986
, Faster randomized consensus with an oblivious adversary, Proc. of 31st PODC, pp.1-8, 2012.
, Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990.
DOI : 10.1145/79147.79158
, Time bounds for decision problems in the presence of timing uncertainty and failures, J. of Parallel Distrib. Comp, issue.8, pp.611096-1109, 2001.
, Adaptive and Efficient Algorithms for Lattice Agreement and Renaming, SIAM Journal on Computing, vol.31, issue.2, pp.642-664, 2001.
DOI : 10.1137/S0097539700366000
, Counting-based impossibility proofs for renaming and set agreement, Proc. of 26th DISC, pp.356-370, 2012.
, Balanced Allocations, SIAM Journal on Computing, vol.29, issue.1, pp.180-200, 1999.
DOI : 10.1137/S0097539795288490
, Shared-memory vs. message-passing in an asynchronous distributed environment, Proc. of 8th PODC, pp.307-318, 1989.
, 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
, Multilevel adaptive hashing, Proc. of 1st SODA, pp.43-53, 1990.
, Fully-adaptive algorithms for long-lived renaming, Distributed Computing, vol.25, issue.1, pp.119-134, 2011.
DOI : 10.1007/s00446-011-0137-5
, The ambiguity of choosing, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing , PODC '89, pp.145-157, 1989.
DOI : 10.1145/72981.72991
, New combinatorial topology bounds for renaming: the lower bound, Distributed Computing, vol.29, issue.5, pp.5-6287, 2010.
DOI : 10.1007/s00446-010-0108-2
, New combinatorial topology bounds for renaming, Journal of the ACM, vol.59, issue.1, p.3, 2012.
DOI : 10.1145/2108242.2108245
, Long-lived, fast, waitfree renaming with optimal name space and high throughput, Proc. of 12th DISC, pp.149-160, 1998.
DOI : 10.1007/BFb0056480
, Space Efficient Hash Tables with Worst Case Constant Access Time, Theory of Computing Systems, vol.38, issue.2, pp.229-248, 2005.
DOI : 10.1007/s00224-004-1195-x
, 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
DOI : 10.1145/2332432.2332436
URL : https://hal.archives-ouvertes.fr/hal-00722947
, 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
, 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
, 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
, Randomized mutual exclusion with sub-logarithmic RMR-complexity, Distributed Computing, vol.9, issue.1
DOI : 10.1007/s00446-011-0128-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.7817
, The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures, Proc. of 16th DISC, pp.339-353, 2002.
DOI : 10.1007/3-540-36108-1_23
, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.
DOI : 10.1145/331524.331529
, A time complexity lower bound for randomized implementations of some shared objects, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98
DOI : 10.1145/277697.277735
, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, 2005.
DOI : 10.1017/CBO9780511813603
, Wait-free algorithms for fast, long-lived renaming, Science of Computer Programming, vol.25, issue.1, pp.1-39, 1995.
DOI : 10.1016/0167-6423(95)00009-H
URL : http://doi.org/10.1016/0167-6423(95)00009-h
, Randomized naming using wait-free shared variables, Distributed Computing, vol.11, issue.3, pp.113-124, 1998.
DOI : 10.1007/s004460050045
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6861
, Reaching Agreement in the Presence of Faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980.
DOI : 10.1145/322186.322188
, Probabilistic computations: Toward a unified measure of complexity, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.222-227, 1977.
DOI : 10.1109/SFCS.1977.24