A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Further comments on Dijkstra's concurrent programming control problem
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract)
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Limitations of synchronization primitives with conditional branching and global variables
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of parallel algorithms
The complexity of parallel algorithms
Complexity of communication among asynchronous parallel processes
Complexity of communication among asynchronous parallel processes
An efficient solution to the mutual exclusion problem using unfair and weak semaphore
ACM SIGOPS Operating Systems Review
Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Tight bounds for shared memory symmetric mutual exclusion problems
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Fairness in processor scheduling in time sharing systems
ACM SIGOPS Operating Systems Review
Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Randomized mutual exclusion algorithms revisited
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Lower bounds for randomized mutual exclusion
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Space bounds for transactional synchronization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Semaphore primitives and starvation-free mutual exclusion
Journal of the ACM (JACM)
Decentralized Simulation of Resource Managers
Journal of the ACM (JACM)
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Randomized two-process wait-free test-and-set
Distributed Computing
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
Journal of Parallel and Distributed Computing
Computing with infinitely many processes
Information and Computation
| Hi-index | 0.01 |