On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fault-tolerant decision making in totally asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of 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
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Delimiting the power of bounded size synchronization objects (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Set consensus using arbitrary objects (preliminary version)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Towards a topological characterization of asynchronous complexity
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
The topological structure of asynchronous computability
Journal of the ACM (JACM)
k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
An Efficient Solution to the k-Set Agreement Problem
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
A Condition for k-Set Agreement in Asynchronous Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A New Synchronous Lower Bound for Set Agreement
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
tight bounds for k-set agreement with limited-scope failure detectors
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Tight bounds for k-set agreement with limited-scope failure detectors
Distributed Computing - Special issue: DISC 03
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Failure detectors in loosely named systems
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The 0---1-Exclusion Families of Tasks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Classifying rendezvous tasks of arbitrary dimension
Theoretical Computer Science
Extracting quorum failure detectors
Proceedings of the 28th ACM symposium on Principles of distributed computing
The weakest failure detector for solving k-set agreement
Proceedings of the 28th ACM symposium on Principles of distributed computing
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
The disagreement power of an adversary
DISC'09 Proceedings of the 23rd international conference on Distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
New combinatorial topology bounds for renaming: The upper bound
Journal of the ACM (JACM)
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Optimal randomized fair exchange with secret shared coins
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
From crash-stop to permanent omission: automatic transformation and weakest failure detectors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |