Complexity of network synchronization
Journal of the ACM (JACM)
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
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
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
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
Towards a topological characterization of asynchronous complexity
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The unified structure of consensus: a layered analysis approach
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
Reaching Agreement in the Presence of Faults
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
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
Fast set agreement in the presence of timing uncertainty
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A New Synchronous Lower Bound for Set Agreement
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
tight bounds for k-set agreement with limited-scope failure detectors
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Mathematical Structures in Computer Science
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
Tight bounds for k-set agreement with limited-scope failure detectors
Distributed Computing - Special issue: DISC 03
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A topological treatment of early-deciding set-agreement
Theoretical Computer Science
The Complexity of Early Deciding Set Agreement: How can Topology help?
Electronic Notes in Theoretical Computer Science (ENTCS)
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
The topology of shared-memory adversaries
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Concurrent computing and shellable complexes
DISC'10 Proceedings of the 24th international conference on Distributed computing
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Structured derivation of semi-synchronous algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
The Complexity of Early Deciding Set Agreement
SIAM Journal on Computing
A topological treatment of early-deciding set-agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The committee decision problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
An equivariance theorem with applications to renaming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Computability in distributed computing: a Tutorial
ACM SIGACT News
| Hi-index | 0.00 |