Asynchronous byzantine agreement protocols
Information and Computation
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms
Atomic snapshots of shared memory
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Wait-free k-set agreement is impossible: the topology of public knowledge
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Are wait-free algorithms fast?
Journal of the ACM (JACM)
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
3-processor tasks are undecidable
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Computing with faulty shared objects
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract)
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
A tight lower bound for k-set agreement
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Hi-index | 0.00 |