On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On achieving consensus using a shared memory
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
Bounded polynomial randomized consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Fast randomized consensus using shared memory
Journal of Algorithms
Agreement is harder than consensus: set consensus problems in totally asynchronous systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Time-and space-efficient randomized consensus
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Efficiency of Synchronous Versus Asynchronous Distributed Systems
Journal of the ACM (JACM)
Simple constant-time consensus protocols in realistic failure models (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Hints for computer system design
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
The Virtue of Patience: Concurrent Programming with and Without Waiting
The Virtue of Patience: Concurrent Programming with and Without Waiting
Randomized wait-free concurrent objects (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
On the space complexity of randomized synchronization
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Are wait-free algorithms fast?
Journal of the ACM (JACM)
Resilience of general interactive tasks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Computing with faulty shared objects
Journal of the ACM (JACM)
ACM SIGACT News
Modular competitiveness for distributed algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Spreading rumors rapidly despite an adversary
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient asynchronous consensus with the weak adversary scheduler
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Cooperative sharing and asynchronous consensus using single-reader single-writer registers
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast deterministic consensus in a noisy environment
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Wait-free consensus with infinite arrivals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Fast deterministic consensus in a noisy environment
Journal of Algorithms
Randomized two-process wait-free test-and-set
Distributed Computing
Work-competitive scheduling for cooperative computing with dynamic groups
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cooperative computing with fragmentable and mergeable groups
Journal of Discrete Algorithms
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Randomized naming using wait-free shared variables
Distributed Computing
Consistent and automatic replica regeneration
ACM Transactions on Storage (TOS)
Cooperative asynchronous update of shared memory
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
Theoretical Computer Science
Dynamic load balancing with group communication
Theoretical Computer Science
Tight bounds for asynchronous randomized consensus
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Consistent and automatic replica regeneration
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Randomized consensus in expected O(n log n) individual work
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
Approximate shared-memory counting despite a strong adversary
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Combining shared-coin algorithms
Journal of Parallel and Distributed Computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Approximate shared-memory counting despite a strong adversary
ACM Transactions on Algorithms (TALG)
Multi-sided shared coins and randomized set-agreement
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
On the power of hardware transactional memory to simplify memory management
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Randomized consensus in expected O(n2) total work using single-writer registers
DISC'11 Proceedings of the 25th international conference on Distributed computing
When agents communicate hypotheses in critical situations
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.00 |