A gap theorem for consensus types extended abstract
PODC '94 Proceedings of the thirteenth 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
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
Structured derivations of consensus algorithms for failure detectors
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
Stability of long-lived consensus (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Tight bounds for k-set agreement
Journal of the ACM (JACM)
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Objects Shared by Byzantine Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Wait-Free n-Set Consensus When Inputs Are Restricted
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
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Stability of long-lived consensus
Journal of Computer and System Sciences
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Mathematical Structures in Computer Science
A necessary and sufficient condition for transforming limited accuracy failure detectors
Journal of Computer and System Sciences
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing
Computable obstructions to wait-free computability
Distributed Computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Objects shared by Byzantine processes
Distributed Computing
Closed schedulers: a novel technique for analyzing asynchronous protocols
Distributed Computing
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
Distributed Computing
Irreducibility and additivity of set agreement-oriented failure detector classes
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Global computing in a dynamic network of tuple spaces
Science of Computer Programming
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Anti-Ω: the weakest failure detector for set agreement
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
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Research note: On Byzantine generals with alternative plans
Journal of Parallel and Distributed Computing
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Local Maps: New Insights into Mobile Agent Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A topological treatment of early-deciding set-agreement
Theoretical Computer Science
From adaptive renaming to set agreement
Theoretical Computer Science
The Complexity of Early Deciding Set Agreement: How can Topology help?
Electronic Notes in Theoretical Computer Science (ENTCS)
A note on atomicity: Boosting Test&Set to solve consensus
Information Processing Letters
Classifying rendezvous tasks of arbitrary dimension
Theoretical Computer Science
Proceedings of the 28th ACM symposium on Principles of distributed computing
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Theoretical Computer Science
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
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
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
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
Future directions in distributed computing
Multi-sided shared coins and randomized set-agreement
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Tight group renaming on groups of size g is equivalent to g-consensus
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
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
Brief announcement: new bounds for partially synchronous set agreement
DISC'10 Proceedings of the 24th international conference on Distributed computing
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
The universe of symmetry breaking tasks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
Relations linking failure detectors associated with k-set agreement in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Structured derivation of semi-synchronous algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
The Complexity of Early Deciding Set Agreement
SIAM Journal on Computing
In search of the holy grail: looking for the weakest failure detector for wait-free set agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
A topological treatment of early-deciding set-agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Renaming with k-set-consensus: an optimal algorithm into n + k - 1 slots
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Simultaneous consensus tasks: a tighter characterization of set-consensus
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Stabilizing consensus in mobile networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Pattern matching over a dynamic network of tuple spaces
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Early-stopping k-set agreement in synchronous systems prone to any number of process crashes
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Global computing in a dynamic network of tuple spaces
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
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
Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
Electronic Notes in Theoretical Computer Science (ENTCS)
The renaming problem in shared memory systems: An introduction
Computer Science Review
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Early deciding synchronous renaming in o( logf) rounds or less
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Weakening failure detectors for k-set agreement via the partition approach
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Computability in distributed computing: a Tutorial
ACM SIGACT News
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.01 |