Wait-free Test-and-Set (Extended Abstract)

On the robustness of Herlihy's hierarchy

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing

A completeness theorem for a class of synchronization objects

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing

Computing with faulty shared objects

Journal of the ACM (JACM)

Polylog randomized wait-free consensus

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing

Randomized two-process wait-free test-and-set

Distributed Computing

Randomized naming using wait-free shared variables

Distributed Computing

Bounded time-stamps

Distributed Computing

Common2 extended to stacks and unbounded concurrency

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

Fast randomized test-and-set and renaming

DISC'10 Proceedings of the 24th international conference on Distributed computing

Optimal-time adaptive strong renaming, with applications to counting

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Sub-logarithmic test-and-set against aweak adversary

DISC'11 Proceedings of the 25th international conference on Distributed computing

On the cost of composing shared-memory algorithms

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

On the time and space complexity of randomized test-and-set

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms

Proceedings of the 2013 ACM symposium on Principles of distributed computing