Foundations of knowledge for distributed systems
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Extended impossibility results for asynchronous complete networks
Information Processing Letters
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Topology via logic
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
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
ACM Transactions on Programming Languages and Systems (TOPLAS)
Knowledge in shared memory systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Topology and category theory in computer science
Topology and category theory in computer science
Generalized FLP impossibility result for t-resilient asynchronous computations
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
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed 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
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
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
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 direct lower bound for k-set consensus
PODC '98 Proceedings of the seventeenth 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
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
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
Computable obstructions to wait-free computability
Distributed Computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Closed schedulers: a novel technique for analyzing asynchronous protocols
Distributed Computing
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
Failure detectors in loosely named systems
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Classifying rendezvous tasks of arbitrary dimension
Theoretical Computer Science
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
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed computing: a Glimmer of a theory
Algorithms and theory of computation handbook
The Complexity of Early Deciding Set Agreement
SIAM Journal on Computing
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
Electronic Notes in Theoretical Computer Science (ENTCS)
A lambda calculus for gödel---dummett logic capturing waitfreedom
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Hi-index | 0.00 |