Fast, Long-Lived Renaming (Extended Abstract)

Using k-exclusion to implement resilient, scalable shared objects (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing

Long-lived renaming made fast

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing

Lamport on mutual exclusion: 27 years of planting seeds

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing

Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps

DISC '01 Proceedings of the 15th International Conference on Distributed Computing

Long-Lived Adaptive Collect with Applications

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Shared-memory mutual exclusion: major research trends since 1986

Distributed Computing - Papers in celebration of the 20th anniversary of PODC

Long lived adaptive splitter and applications

Distributed Computing

Using local-spin k-exclusion algorithms to improve wait-free object implementations

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

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

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

Early deciding synchronous renaming in o( logf) rounds or less

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity