Shared-memory vs. message-passing in an asynchronous distributed environment
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
A combinatorial characterization of the distributed 1-solvable tasks
Journal of Algorithms
Lower bounds for wait-free computation in message-passing systems
PODC '90 Proceedings of the ninth 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
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Set consensus using arbitrary objects (preliminary version)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unifying synchronous and asynchronous message-passing models
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms
Tight bounds for k-set agreement
Journal of the ACM (JACM)
A New Synchronous Lower Bound for Set Agreement
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Evaluation of the capability of interaction
ACM SIGGROUP Bulletin - Special issue on community-based learning: explorations into theoretical groundings, empirical findings and computer support
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Tight bounds for k-set agreement with limited-scope failure detectors
Distributed Computing - Special issue: DISC 03
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
From adaptive renaming to set agreement
Theoretical Computer Science
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Theoretical Computer Science
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Narrowing power vs. efficiency in synchronous set agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The topology of shared-memory adversaries
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Applications of shellable complexes to distributed computing
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Concurrent computing and shellable complexes
DISC'10 Proceedings of the 24th international conference on Distributed computing
A non-topological proof for the impossibility of k-set agreement
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
New combinatorial topology bounds for renaming: The upper bound
Journal of the ACM (JACM)
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th international conference on Distributed Computing
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
Electronic Notes in Theoretical Computer Science (ENTCS)
The renaming problem in shared memory systems: An introduction
Computer Science Review
Simulations and reductions for colorless tasks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Counting-based impossibility proofs for renaming and set agreement
DISC'12 Proceedings of the 26th international conference on Distributed Computing
A non-topological proof for the impossibility of k-set agreement
Theoretical Computer Science
| Hi-index | 0.00 |
Topological methods have yielded a variety of lower bounds and impossibility results for distributed computing. In this paper, we introduce a new tool for proving impossibility results, which is based on a core theorem of algebraic topology, the acyclic carrier theorem, and unifies, generalizes and extends earlier results.