A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Shared-memory vs. message-passing in an asynchronous distributed environment
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Fast randomized consensus using shared memory
Journal of Algorithms
Concurrent timestamping made simple
ISTCS'92 Symposium proceedings on Theory of computing and systems
Atomic snapshots of shared memory
Journal of the ACM (JACM)
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fast, long-lived renaming improved and simplified
Science of Computer Programming
Long-lived renaming made adaptive
Proceedings of the eighteenth 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
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Algorithms adapting to point contention
Journal of the ACM (JACM)
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
An adaptive collect algorithm with applications
Distributed Computing
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
Asynchronous exclusive selection
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Locks Considered Harmful: A Look at Non-traditional Synchronization
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
From adaptive renaming to set agreement
Theoretical Computer Science
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
Wait-free queues with multiple enqueuers and dequeuers
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Renaming in message passing systems with byzantine failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th international conference on Distributed Computing
A methodology for creating fast wait-free data structures
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Can memory be used adaptively by uniform algorithms?
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Adaptive algorithms using bounded memory are inherently non-uniform
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
The renaming problem in shared memory systems: An introduction
Computer Science Review
A closer look at fault tolerance
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |