Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Asymptotically optimal algorithms for approximate agreement
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Atomic snapshots of shared memory
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
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
Sharing memory robustly in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility results for asynchronous PRAM (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
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
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Some Results on the Impossibility, Universality, and Decidability of Consensus
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
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
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
Resilience of general interactive tasks
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
Consensus power makes (some) sense! (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
More on t-resilience vs. wait-freedom (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Wait-free solvability via combinatorial topology
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Simulation as an iterated task
PODC '96 Proceedings of the fifteenth 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
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
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 unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Unifying synchronous and asynchronous message-passing models
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
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
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A direct lower bound for k-set consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast set agreement in the presence of timing uncertainty
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On k-set consensus problems in asynchronous systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
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
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
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
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
On the Importance of Having an Identity or is Consensus Really Universal?
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Computable obstructions to wait-free computability
Distributed Computing
Randomized naming using wait-free shared variables
Distributed Computing
Long lived adaptive splitter and applications
Distributed Computing
Closed schedulers: a novel technique for analyzing asynchronous protocols
Distributed Computing
On the importance of having an identity or, is consensus really universal?
Distributed Computing - Special issue: DISC 04
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh 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
Brief announcement: weakest failure detectors via an egg-laying simulation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed computing: a Glimmer of a theory
Algorithms and theory of computation handbook
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
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
Electronic Notes in Theoretical Computer Science (ENTCS)
Counting-based impossibility proofs for renaming and set agreement
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.01 |