The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Improved algorithms for distributed resource allocation
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Sticky bits and universality of consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Locking without blocking: making lock based concurrent data structure algorithms nonblocking
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for implementing lock-free shared-data structures
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Disjoint-access-parallel implementations of strong shared memory primitives
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Universal constructions for multi-object operations
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The synergy between non-blocking synchronization and operating system structure
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Localizing Failures in Distributed Synchronization
IEEE Transactions on Parallel and Distributed Systems
The power of multi-objects (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Universal operations: unary versus binary
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Atomic m-Register Operations (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Some Results on the Impossibility, Universality, and Decidability of Consensus
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Efficient Wait-Free Implementation of a Concurrent Priority Queue
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Universal Constructions for Large Objects
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
A lower bound on the local time complexity of universal constructions
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A time complexity lower bound for randomized implementations of some shared objects
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Consensus numbers of multi-objects
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A polylog time wait-free construction for closed objects
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Improved implementations of binary universal operations
Journal of the ACM (JACM)
Even Better DCAS-Based Concurrent Deques
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
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
The power of DCAS: highly-concurrent software transactional memory
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Concurrency and the Principle of Data Locality
IEEE Distributed Systems Online
On obstruction-free transactions
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
Highly-concurrent multi-word synchronization
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
The RedBlue adaptive universal constructions
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Highly concurrent multi-word synchronization
Theoretical Computer Science
Single-version STMs can be multi-version permissive
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
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
Built-in coloring for highly-concurrent doubly-linked lists
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Time and space lower bounds for implementations using k-CAS
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Obstruction-Free step complexity: lock-free DCAS as an example
DISC'05 Proceedings of the 19th international conference on Distributed Computing
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
Universal constructions that ensure disjoint-access parallelism and wait-freedom
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Pragmatic primitives for non-blocking data structures
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |