System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Transaction commit in a realistic fault model
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Transaction commitment at minimal communication cost
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fault-tolerant decision making in totally asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Asynchronous approximate agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Detecting global termination conditions in the face of uncertainty
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
Commitment in a partitioned distributed database
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A Compiler that Increases the Fault Tolerance of Asynchronous Protocols
IEEE Transactions on Computers
Reasoning about knowledge and time in asynchronous systems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Automatically increasing the fault-tolerance of distributed systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Sticky bits and universality of consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Efficient parallel algorithms can be made robust
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bounded polynomial randomized consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Fast isolation of arbitrary forwarding faults
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On the improbability of reaching Byzantine agreements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Increasing availability under mutual exclusion constraints with dynamic vote reassignment
ACM Transactions on Computer Systems (TOCS)
Decentralized mutual exclusion in the presence of link failures
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Optimal Distributed t-Resilient Election in Complete Networks
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Early-delivery atomic broadcast
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
Time-and space-efficient randomized consensus
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Lower bounds for wait-free computation in message-passing 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
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
A methodology for implementing highly concurrent data structures
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounds on the time to reach agreement in the presence of timing uncertainty
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Randomized wait-free concurrent objects (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Consensus in the presence of timing uncertainty: omission and Byzantine failures (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Knowledge in shared memory systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Inconsistency and contamination (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Using process groups to implement failure detection in asynchronous environments
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Impossibility results for asynchronous PRAM (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A fault tolerance approach for distributed ISDN control systems
ACM SIGOPS Operating Systems Review
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Ordered and reliable multicast communication
ACM Transactions on Computer Systems (TOCS)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computing with faulty shared memory
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The weakest failure detector for solving consensus
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The possibility and the complexity of achieving fault-tolerant coordination
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Causal controversy at Le Mont St.-Michel
ACM SIGOPS Operating Systems Review
Use of Common Time Base for Checkpointing and Rollback Recovery in a Distributed System
IEEE Transactions on Software Engineering
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Resource bounds and combinations of consensus objects
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of 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
Lower bounds for randomized mutual exclusion
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
How to securely replicate services
ACM Transactions on Programming Languages and Systems (TOPLAS)
Are wait-free algorithms fast?
Journal of the ACM (JACM)
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Time-adaptive algorithms for synchronization
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
Wait-freedom vs. bounded wait-freedom in public data structures (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
Uniform actions in asynchronous distributed systems
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
On the use of registers in achieving wait-free consensus
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
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
On group communication in large-scale distributed systems
ACM SIGOPS Operating Systems Review
An (N -1)-Resilient Algorithm for Distributed Termination Detection
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
Asynchronous consensus and broadcast protocols
Journal of the ACM (JACM)
Efficient message passing interface (MPI) for parallel computing on clusters of workstations
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
On distributed object checkpointing and recovery
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
A framework for protocol composition in Horus
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Failure detectors and the wait-free hierarchy (extended abstract)
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
Lock-free linked lists using compare-and-swap
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Totem: a fault-tolerant multicast group communication system
Communications of the ACM
From group communication to transactions in distributed systems
Communications of the ACM
Communications of the ACM
Computing with faulty shared objects
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Efficient execution of nondeterministic parallel programs on asynchronous systems
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Localizing Failures in Distributed Synchronization
IEEE Transactions on Parallel and Distributed Systems
Efficient message ordering in dynamic networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The power of multi-objects (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fail-awareness in timed asynchronous systems
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
On the impossibility of group membership
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A new look at membership services (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
ACM SIGOPS Operating Systems Review
Enriched View Synchrony: A Programming Paradigm for Partitionable Asynchronous Distributed Systems
IEEE Transactions on Computers
Lower bounds for distributed coin-flipping and randomized consensus
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
All of us are smarter than any of us: wait-free hierarchies are not robust
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
On the power of shared object types to implement one-resilient Consensus
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed 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
Efficient asynchronous consensus with the weak adversary scheduler
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Contention in shared memory algorithms
Journal of the ACM (JACM)
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
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
The message classification model
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Consensus numbers of multi-objects
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 consistent history link connectivity protocol
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fault-tolerant distributed simulation
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
ACM Transactions on Computer Systems (TOCS)
A Configurable Membership Service
IEEE Transactions on Computers
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Coyote: a system for constructing fine-grain configurable communication services
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
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 Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
Cooperative sharing and asynchronous consensus using single-reader single-writer registers
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Quality of service for wide area clusters
Proceedings of the 8th ACM SIGOPS European workshop on Support for composing distributed applications
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks
Mobile Networks and Applications
Secure protocol transformation via “expansion”: from two-party to groups
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Journal of the ACM (JACM)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms
IEEE Transactions on Software Engineering
CSC '91 Proceedings of the 19th annual conference on Computer Science
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Fast deterministic consensus in a noisy environment
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
Tight bounds for k-set agreement
Journal of the ACM (JACM)
IEEE Transactions on Software Engineering
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computing in the RAIN: A Reliable Array of Independent Nodes
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Abstractions for mobile computations
Secure Internet programming
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
Group Communication in Partitionable Systems: Specification and Algorithms
IEEE Transactions on Software Engineering
Consensus-based fault-tolerant total order multicast
IEEE Transactions on Parallel and Distributed Systems
On beyond registers: wait-free readable objects
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
On scalable and efficient distributed failure detectors
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Detecting distributed cycles of garbage in large-scale systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Inductive methods and contract-signing protocols
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
The SecureRing group communication system
ACM Transactions on Information and System Security (TISSEC)
A fault tolerance approach for distributed ISDN control systems
EW 4 Proceedings of the 4th workshop on ACM SIGOPS European workshop
A formalism for fault-tolerant applications in asynchronous systems
EW 4 Proceedings of the 4th workshop on ACM SIGOPS European workshop
On group communication in large-scale distributed systems
EW 6 Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
Wait-free consensus with infinite arrivals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
A Distributed Parallel Programming Framework
IEEE Transactions on Software Engineering
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
ACM SIGACT news distributed computing column 5
ACM SIGACT News
Supporting configuration management for virtual workgroups in a peer-to-peer setting
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
COCA: A secure distributed online certification authority
ACM Transactions on Computer Systems (TOCS)
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The inherent price of indulgence
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Building responsive TMR-based servers in presence of timing constraints
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Asynchronous verifiable secret sharing and proactive cryptosystems
Proceedings of the 9th ACM conference on Computer and communications security
A fault detection service for wide area distributed computations
Cluster Computing
Object-Oriented Design of QoS Multicast Communications
Cluster Computing
Simulation-based Testing of Communication Protocols for Dependable Embedded Systems
The Journal of Supercomputing - Special issue on embedded fault-tolerance systems
Fast deterministic consensus in a noisy environment
Journal of Algorithms
Constructing Dependable Web Services
IEEE Internet Computing
RMP: Fault-Tolerant Group Communication
IEEE Micro
Reliability Through Consistency
IEEE Software
Mastering Agreement Problems in Distributed Systems
IEEE Software
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
IEEE Transactions on Computers
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
The Timewheel Group Communication System
IEEE Transactions on Computers
Solving the Group Priority Inversion Problem in a Timed Asynchronous System
IEEE Transactions on Computers
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
IEEE Transactions on Computers
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Consensus-Based Fault-Tolerant Total Order Multicast
IEEE Transactions on Parallel and Distributed Systems
On Group Communication Support in CORBA
IEEE Transactions on Parallel and Distributed Systems
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Protocol for Atomic Broadcast
IEEE Transactions on Parallel and Distributed Systems
Processor Membership in Asynchronous Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems
A Group Membership Algorithm with a Practical Specification
IEEE Transactions on Parallel and Distributed Systems
Compositional Programming Abstractions for Mobile Computing
IEEE Transactions on Software Engineering
ACM SIGACT News
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Tolerating transient and intermittent failures
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
Perfect Failure Detection in Timed Asynchronous Systems
IEEE Transactions on Computers
Muteness Failure Detectors: Specification and Implementation
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Solving Agreement Problems with Weak Ordering Oracles
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
An Efficient Solution to the k-Set Agreement Problem
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Fast Indulgent Consensus with Zero Degradation
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
The Raincore Distributed Session Service for Networking Elements
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Consensus Based on Strong Failure Detectors: A Time and Message-Efficient Protocol
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Condition for k-Set Agreement in Asynchronous Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Consistent Lamport Clocks for Asynchronous Groups with Process Crashes
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Consensus in One Communication Step
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Asynchronous Group Membership with Oracles
Proceedings of the 13th International Symposium on Distributed Computing
Proceedings of the 13th International Symposium on Distributed Computing
Abuse-Free Multi-party Contract Signing
Proceedings of the 13th International Symposium on Distributed Computing
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
A Probabilistically Correct Leader Election Protocol for Large Groups
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
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
The Complexity of Synchronous Iterative Do-All with Crashes
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A New Synchronous Lower Bound for Set Agreement
DISC '01 Proceedings of the 15th 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
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Failure Detection Lower Bounds on Registers and Consensus
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Optimal Approximate Agreement with Omission Faults
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Encapsulating Failure Detection: From Crash to Byzantine Failures
Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
Quorum-Based Replication in Asynchronous Crash-Recovery Distributed Systems (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
A Fault-Tolerant Sequencer for Timed Asynchronous Systems
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Revisiting Safety and Liveness in the Context of Failures
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Managing Data Quality in Cooperative Information Systems
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Physical Programming: Beyond Mere Logic
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Abuse-Free Optimistic Contract Signing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Secure and Efficient Asynchronous Broadcast Protocols
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Threshold and Bounded-Delay Voting in Critical Control Systems
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
An Overview of Formal Verification for the Time-Triggered Architecture
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Agreement Problems in Fault-Tolerant Distributed Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Membership-Insensitive Totally Ordered Multicast: Properties and Performance
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Asynchronous Secure Communication Tolerating Mixed Adversaries
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
(Im)Possibilities of Predicate Detection in Crash-Affected Systems
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Constructing Dependable Web Services
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Integrating Group Communication with Transactions for Implementing Persistent Replicated Objects
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Time in Distributed System Models and Algorithms
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Programming Partition-Aware Network Applications
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Group Communication in Partitionable Distributed Systems
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Improving Scalability of Replicated Services in Mobile Agent Systems
MA '02 Proceedings of the 6th International Conference on Mobile Agents
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Avoiding Priority Inversion on the Processing of Requests by Active Replicated Servers
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Avoiding Malicious Byzantine Faults by a New Signature Generation Technique
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Computing in the RAIN: A Reliable Array of Independent Nodes
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Randomized two-process wait-free test-and-set
Distributed Computing
Adaptive and efficient mutual exclusion
Distributed Computing
Cryptographic access control in a distributed file system
Proceedings of the eighth ACM symposium on Access control models and technologies
A High-Throughput Secure Reliable Multicast Protocol
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Optimistic atomic broadcast: a pragmatic viewpoint
Theoretical Computer Science - Special issue: Distributed computing
Consensus service: a modular approach for building agreement protocols in distributed systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Group, majority, and strict agreement in timed asynchronous distributed systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
A multiple bus broadcast protocol resilient to non-cooperative Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
A Decentralized, Adaptive Replica Location Mechanism
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Performance Evaluation of a Consensus Algorithm with Petri Nets
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
A General Framework to Solve Agreement Problems
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Real-Time Fault-Tolerant Atomic Broadcast
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Real-time dependable decisions in timed asynchronous distributed systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
A Generic Framework for Indulgent Consensus
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Distributed algorithm engineering
Experimental algorithmics
Operation-valency and the cost of coordination
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Three-tier replication for FT-CORBA infrastructures
Software—Practice & Experience
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Enforcing Perfect Failure Detection
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Asynchronous consensus protocol for the unreliable un-fully connected network
ACM SIGOPS Operating Systems Review
Architectural patterns for real-time systems
UML for real
IEEE Transactions on Knowledge and Data Engineering
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
A Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems
IEEE Transactions on Parallel and Distributed Systems
A Consensus Protocol for CAN-Based Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Synthesis of fault-tolerant concurrent programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms
Consensus in byzantine asynchronous systems
Journal of Discrete Algorithms
Distributed recovery with K-optimistic logging
Journal of Parallel and Distributed Computing
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
A necessary and sufficient condition for transforming limited accuracy failure detectors
Journal of Computer and System Sciences
Performance Analysis of Adaptive Consensus Protocols Based on Slowness Oracles
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Relying on Safe Distance to Achieve Strong Partitionable Group Membership in Ad Hoc Networks
IEEE Transactions on Mobile Computing
A weakest failure detector-based asynchronous consensus protocol for f
Information Processing Letters
Uniform consensus is harder than consensus
Journal of Algorithms
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems
IEEE Transactions on Computers
Extending the Representational State Transfer (REST) Architectural Style for Decentralized Systems
Proceedings of the 26th International Conference on Software Engineering
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On the design of distributed protocols from differential equations
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing
Information Systems - Special issue: Data quality in cooperative information systems
Implementing a replicated service with group communication
Journal of Systems Architecture: the EUROMICRO Journal
CODEX: A Robust and Secure Secret Distribution System
IEEE Transactions on Dependable and Secure Computing
Characterizing distributed systems using knowledge-based models: preliminary version
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
Using knowledge to optimally achieve coordination in distributed systems: extended abstract
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Computable obstructions to wait-free computability
Distributed Computing
Secure reliable multicast protocols in a WAN
Distributed Computing
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
On the use of registers in achieving wait-free consensus
Distributed Computing
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
Randomized naming using wait-free shared variables
Distributed Computing
Handling message semantics with Generic Broadcast protocols
Distributed Computing
Information Processing Letters
Abstractions for fault-tolerant global computing
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A gentle introduction to distributed algorithms
Proceedings of the 2nd annual conference on Mid-south college computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
On the power of shared object types to implement one-resilient Consensus
Distributed Computing
RPC-V: Toward Fault-Tolerant RPC for Internet Connected Desktop Grids with Volatile Nodes
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
MPICH-V2: a Fault Tolerant MPI for Volatile Nodes based on Pessimistic Sender Based Message Logging
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Failure, connectivity and disconnection detectors
UbiMob '04 Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
Asynchronous Complete Distributed Garbage Collection
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
ExchangeGuard: A Distributed Protocol for Electronic Fair-Exchange
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
A Cheap and Safe COTS Wormhole for Local Area Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17
The atomic manifesto: a story in four quarks
ACM SIGOPS Operating Systems Review
ACM Computing Surveys (CSUR)
The atomic manifesto: a story in four quarks
ACM SIGMOD Record
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Distributed Computing
Objects shared by Byzantine processes
Distributed Computing
The mobile groups approach for the coordination of mobile agents
Journal of Parallel and Distributed Computing
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
Closed schedulers: a novel technique for analyzing asynchronous protocols
Distributed Computing
Wait-free linearization with an assertional proof
Distributed Computing
Secure distributed human computation
Proceedings of the 6th ACM conference on Electronic commerce
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing
Fast fault-tolerant agreement algorithms
Proceedings of the twenty-fourth annual ACM symposium on Principles of 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
The weakest failure detector to solve nonuniform consensus
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Consensus and collision detectors in wireless Ad Hoc networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Encyclopedia of Computer Science
Future Generation Computer Systems - Special issue: P2P computing and interaction with grids
Some impossibility results in interprocess synchronization
Distributed Computing
Necessary and sufficient conditions for broadcast consensus protocols
Distributed Computing
Knowledge in shared memory systems
Distributed Computing
Distributed Computing
Reliability versus cost: design of a probabilistic broadcast algorithm
Distributed Computing
Distributed Computing
APSS: proactive secret sharing in asynchronous systems
ACM Transactions on Information and System Security (TISSEC)
Implementing Trustworthy Services Using Replicated State Machines
IEEE Security and Privacy
Complexity Issues in Automated Synthesis of Failsafe Fault-Tolerance
IEEE Transactions on Dependable and Secure Computing
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
A Family of Trusted Third Party Based Fair-Exchange Protocols
IEEE Transactions on Dependable and Secure Computing
Détection de partition pour la gestion de groupes en environnement mobile
UbiMob '05 Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing
From Set Membership to Group Membership: A Separation of Concerns
IEEE Transactions on Dependable and Secure Computing
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
Illustrating the impossibility of crash-tolerant consensus in asynchronous systems
ACM SIGOPS Operating Systems Review
Time-space tradeoffs for implementations of snapshots
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Consensus on transaction commit
ACM Transactions on Database Systems (TODS)
DieHard: probabilistic memory safety for unsafe languages
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts
Proceedings of the 2006 ACM symposium on Applied computing
Proactive resilience through architectural hybridization
Proceedings of the 2006 ACM symposium on Applied computing
Active disk Paxos with infinitely many processes
Distributed Computing - Special issue: PODC 02
The inherent price of indulgence
Distributed Computing - Special issue: PODC 02
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of 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
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Synchronizing without locks is inherently expensive
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Efficient parallel algorithms can be made robust
Distributed Computing
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Distributed Computing
Low complexity Byzantine-resilient consensus
Distributed Computing
Fully Distributed Three-Tier Active Software Replication
IEEE Transactions on Parallel and Distributed Systems
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership
IEEE Transactions on Parallel and Distributed Systems
Condition Adaptation in Synchronous Consensus
IEEE Transactions on Computers
IEEE Transactions on Dependable and Secure Computing
Tight bounds for shared memory systems accessed by Byzantine processes
Distributed Computing - Special issue: DISC 03
Construction of a fault-tolerant wireless communication topology using distributed agreement
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Implementing fault-tolerance in real-time systems by automatic program transformations
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
An intruder model for verifying liveness in security protocols
Proceedings of the fourth ACM workshop on Formal methods in security
Orchestrating fair exchanges between mutually distrustful web services
Proceedings of the 3rd ACM workshop on Secure web services
Type-based publish/subscribe: Concepts and experiences
ACM Transactions on Programming Languages and Systems (TOPLAS)
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Global computing in a dynamic network of tuple spaces
Science of Computer Programming
Research note: From ♢W to Ω: A simple bounded quiescent reliable broadcast-based transformation
Journal of Parallel and Distributed Computing
Managed Agreement: Generalizing two fundamental distributed agreement problems
Information Processing Letters
Worm-IT - A wormhole-based intrusion-tolerant group communication system
Journal of Systems and Software
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Information Processing Letters
How to safely close a discussion
Information Processing Letters
Harmful dogmas in fault tolerant distributed computing
ACM SIGACT News
The perfectly synchronized round-based model of distributed computing
Information and Computation
Middleware/application interactions to support adaptive dependability
MAI '07 Proceedings of the 1st workshop on Middleware-application interaction: in conjunction with Euro-Sys 2007
Specifying and using intrusion masking models to process distributed operations
Journal of Computer Security
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
Evaluation of the QoS of crash-recovery failure detection
Proceedings of the 2007 ACM symposium on Applied computing
A new adaptive accrual failure detector for dependable distributed systems
Proceedings of the 2007 ACM symposium on Applied computing
The notion of a timed register and its application to indulgent synchronization
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Tight bounds for asynchronous randomized consensus
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The many faces of systems research: and how to evaluate them
HOTOS'05 Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10
FUSE: lightweight guaranteed distributed failure notification
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
A Language-Driven Tool for Fault Injection in Distributed Systems
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Ensuring e-Transaction with Asynchronous and Uncoordinated Application Server Replicas
IEEE Transactions on Parallel and Distributed Systems
On the Respective Power of ◊P and ◊S to Solve One-Shot Agreement Problems
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Programming Model for Fault-Tolerant Distributed Computing
IEEE Transactions on Dependable and Secure Computing
The election problem in asynchronous distributed systems with bounded faulty processes
The Journal of Supercomputing
Probabilistic Configuration Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Science of Computer Programming
Filterfresh: hot replication of java RMI server objects
COOTS'98 Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks
IEEE Transactions on Computers
Practical Routing in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
Conflict management for real-time collaborative editing in mobile replicated architectures
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
The Chubby lock service for loosely-coupled distributed systems
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Aggregation methods for large-scale sensor networks
ACM Transactions on Sensor Networks (TOSN)
Message and time efficient consensus protocols for synchronous distributed systems
Journal of Parallel and Distributed Computing
Total order broadcast on pervasive systems
Proceedings of the 2008 ACM symposium on Applied computing
On fractional dynamic faults with thresholds
Theoretical Computer Science
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences
Implementing fault-tolerance in real-time programs by automatic program transformations
ACM Transactions on Embedded Computing Systems (TECS)
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Journal of Parallel and Distributed Computing
On obstruction-free transactions
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Achievable cases in an asynchronous environment
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Jgroup-ARM: a distributed object group platform with autonomous replication management
Software—Practice & Experience
Nysiad: practical protocol transformation to tolerate Byzantine failures
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Distributed computing in SOSP and OSDI
ACM SIGACT News
Modularity: a first class concept to address distributed systems
ACM SIGACT News
On the coordinator's rule for Fast Paxos
Information Processing Letters
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
A methodology to design arbitrary failure detectors for distributed protocols
Journal of Systems Architecture: the EUROMICRO Journal
Zyzzyva: speculative Byzantine fault tolerance
Communications of the ACM - Remembering Jim Gray
Beyond nash equilibrium: solution concepts for the 21st century
Proceedings of the twenty-seventh 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
On the complexity of asynchronous gossip
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
Randomized consensus in expected O(n log n) individual work
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Asynchronous exclusive selection
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Wait-free programming for general purpose computations on graphics processors
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
Towards automated design of MAC protocols for underwater wireless networks
Proceedings of the third ACM international workshop on Underwater Networks
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
Effective service replication mechanisms exploiting agent mobility
SEPADS'08 Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Agreement and consistency without knowing the number of processes
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Agreement without knowing everybody: a first step to dynamicity
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Preserving the consistency of distributed objects with real-time transactions
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
A Theory of Bounded Fair Scheduling
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Fair Exchange Is Incomparable to Consensus
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The Synchronization Power of Coalesced Memory Accesses
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Bosco: One-Step Byzantine Asynchronous Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Using Bounded Model Checking to Verify Consensus Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Adaptive replication control based on consensus
Proceedings of the 2nd workshop on Dependable distributed data management
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
LIDeA: a distributed lightweight intrusion detection architecture for sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Optimal message-driven implementations of omega with mute processes
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Failure Detection Service for Large Scale Systems
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
The Asynchronous Bounded-Cycle Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Byzantine Consensus with Unknown Participants
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
With Finite Memory Consensus Is Easier Than Reliable Broadcast
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
The 0---1-Exclusion Families of Tasks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Approximate shared-memory counting despite a strong adversary
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A topological treatment of early-deciding set-agreement
Theoretical Computer Science
A novel fault-tolerant execution model by using of mobile agents
Journal of Network and Computer Applications
Rapid almost-complete broadcasting in faulty networks
Theoretical Computer Science
Revisiting simultaneous consensus with crash failures
Journal of Parallel and Distributed Computing
A step towards a new generation of group communication systems
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Middleware support for adaptive dependability
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Electronic Notes in Theoretical Computer Science (ENTCS)
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)
Minuet: rethinking concurrency control in storage area networks
FAST '09 Proccedings of the 7th conference on File and storage technologies
Cross-layer cooperation between membership estimation and routing
Proceedings of the 2009 ACM symposium on Applied Computing
Classifying rendezvous tasks of arbitrary dimension
Theoretical Computer Science
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
The extended BG-simulation and the characterization of t-resiliency
Proceedings of the forty-first annual ACM symposium on Theory of computing
The complexity of obstruction-free implementations
Journal of the ACM (JACM)
Design of the notification system for failure detectors
International Journal of High Performance Computing and Networking
Non-blocking programming on multi-core graphics processors: (extended asbtract)
ACM SIGARCH Computer Architecture News
Global data computation in chordal rings
Journal of Parallel and Distributed Computing
Making Byzantine fault tolerant systems tolerate Byzantine faults
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
CrystalBall: predicting and preventing inconsistencies in deployed distributed systems
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
The Incompleteness of Planning with Volatile External Information
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A Generic Group Communication Approach for Hybrid Distributed Systems
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Bounded cost algorithms for multivalued consensus using binary consensus instances
Information Processing Letters
Transactional Memory: Glimmer of a Theory
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
About efficiency in wireless communication frameworks on vehicular networks
The First International Workshop on Wireless Networking for Intelligent Transportation Systems
Extracting quorum failure detectors
Proceedings of the 28th 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
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
Partial synchrony based on set timeliness
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Correctness of gossip-based membership under message loss
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
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: global consistency can be easier than point-to-point communication
Proceedings of the 28th ACM symposium on Principles of distributed computing
Remote storage with byzantine servers
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Theoretical Computer Science
Computer Standards & Interfaces
IEEE Journal on Selected Areas in Communications - Special issue on wireless and pervasive communications for healthcare
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Information Processing Letters
Zyzzyva: Speculative Byzantine fault tolerance
ACM Transactions on Computer Systems (TOCS)
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
A simple and communication-efficient Omega algorithm in the crash-recovery model
Information Processing Letters
Set-valued consensus for distributed clock synchronization
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
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
Engineering Distributed Shared Memory Middleware for Java
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
A Stability Criteria Membership Protocol for Ad Hoc Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Enhanced Fault-Tolerance through Byzantine Failure Detection
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the Computational Power of Shared Objects
OPODIS '09 Proceedings of the 13th International Conference on Principles 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
SAFE: scalable autonomous fault-tolerant Ethernet
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Automatic Verification of Fault-Tolerant Register Emulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining shared-coin algorithms
Journal of Parallel and Distributed Computing
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
Approximate shared-memory counting despite a strong adversary
ACM Transactions on Algorithms (TALG)
Predicting and preventing inconsistencies in deployed distributed systems
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
Semi-passive replication and Lazy Consensus
Journal of Parallel and Distributed Computing
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Unconscious eventual consistency with gossips
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Optimal message-driven implementation of omega with mute processes
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Rapid almost-complete broadcasting in faulty networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Reliability of a distributed search engine for fresh information retrieval in large-scale intranet
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Using failure injection mechanisms to experiment and evaluate a grid failure detector
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
ARCS'07 Proceedings of the 20th international conference on Architecture of computing systems
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Revisiting the impossibility for boosting service resilience
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A pattern-based approach for modeling and analyzing error recovery
Architecting dependable systems IV
Modelling remote concurrency with Ada: case study of symmetric non-deterministic rendezvous
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Design and performance of a generic consensus component for critical distributed applications
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Learning from the past for resolving dilemmas of asynchrony
ACM SIGOPS Operating Systems Review
Asynchronous Byzantine consensus with 2f+1 processes
Proceedings of the 2010 ACM Symposium on Applied Computing
Nuovo DRM paradiso: towards a verified fair DRM scheme
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Byzantine consensus with few synchronous links
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
From an intermittent rotating star to a leader
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
N-consensus is the second strongest object for N + 1 processes
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
The anonymous consensus hierarchy and naming problems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Middleware support for adaptive dependability
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Byzantine self-stabilizing pulse in a bounded-delay model
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The truth system: can a system of lying processes stabilize?
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
On the probabilistic omission adversary
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Scalable authenticated tree based group key exchange for ad-hoc groups
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
The building blocks of consensus
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
On optimal probabilistic asynchronous Byzantine agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Narrowing power vs. efficiency in synchronous set agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Practical impact of group communication theory
Future directions in distributed computing
Future directions in distributed computing
Lower bounds for asynchronous consensus
Future directions in distributed computing
Comparing the atomic commitment and consensus problems
Future directions in distributed computing
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Modeling complexity in secure distributed computing
Future directions in distributed computing
Dissecting distributed computations
Future directions in distributed computing
Uncertainty and predictability: can they be reconciled?
Future directions in distributed computing
A data-centric approach for scalable state machine replication
Future directions in distributed computing
Holistic operations in large-scale sensor network systems: a probabilistic peer-to-peer approach
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
Brief announcement: byzantine agreement with homonyms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The disagreement power of an adversary
DISC'09 Proceedings of the 23rd international conference on Distributed computing
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Randomization can be a healer: consensus with dynamic omission failures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Tight group renaming on groups of size g is equivalent to g-consensus
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
At-most-once semantics in asynchronous shared memory
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: dynamic FTSS in asynchronous systems: the case of unison
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the existence of weakest failure detectors for mutual exclusion and k-exclusion
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
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: a leader-free byzantine consensus algorithm
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
On asymmetric progress conditions
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: a shared disk on distributed storage
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: communication efficient asynchronous byzantine agreement
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Information Processing Letters
When consensus meets self-stabilization
Journal of Computer and System Sciences
Scalable byzantine computation
ACM SIGACT News
HotOS'09 Proceedings of the 12th conference on Hot topics in operating systems
Data-centric reconfiguration with network-attached disks
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
Adaptive routing in mobile ad hoc networks based on decision aid approach
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
Distributed computing: a Glimmer of a theory
Algorithms and theory of computation handbook
The failure detector abstraction
ACM Computing Surveys (CSUR)
The x-wait-freedom progress condition
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
Anonymous asynchronous systems: the case of failure detectors
DISC'10 Proceedings of the 24th international conference on Distributed computing
The computational structure of progress conditions
DISC'10 Proceedings of the 24th international conference on Distributed computing
Eventually consistent failure detectors
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
On the impossibility of implementing perpetual failure detectors in partially synchronous systems
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Communication-efficient and crash-quiescent Omega with unknown membership
Information Processing Letters
Autonomous and scalable failure detection in distributed systems
International Journal of Autonomous and Adaptive Communications Systems
Communication-efficient failure detection and consensus in omission environments
Information Processing Letters
Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Failure detectors encapsulate fairness
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
(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
On the automated implementation of time-based paxos using the IOA compiler
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Turning adversaries into friends: simplified, made constructive, and extended
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Architecture and protocol support for providing consensus as a fault-tolerant virtualised service
Proceedings of the 8th International Conference on Frontiers of Information Technology
Relating L-resilience and wait-freedom via hitting sets
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A necessary and sufficient synchrony condition for solving Byzantine consensus in symmetric networks
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A new method for formalizing optimistic fair exchange protocols
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Distributed agreement in tile self-assembly
Natural Computing: an international journal
The impossibility of boosting distributed service resilience
Information and Computation
Rewriting: sleeping to get there faster
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Dynamic FTSS in asynchronous systems: The case of unison
Theoretical Computer Science
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
From bounded to unbounded concurrency objects and back
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The universe of symmetry breaking tasks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed computing with rules of thumb
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient fault tolerant consensus using preemptive token
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
The computational power of the W And GHZ States
Quantum Information & Computation
Quantum Information & Computation
On composability of reliable unicast and broadcast
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A leader-free Byzantine consensus algorithm
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Authenticated Byzantine generals in dual failure model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
The Asynchronous Bounded-Cycle model
Theoretical Computer Science
Multicast with aggregated deliveries
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Communication-efficient leader election in crash-recovery systems
Journal of Systems and Software
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Detecting failures in distributed systems with the Falcon spy network
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
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
Formal verification of consensus algorithms tolerating malicious faults
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Tight space bounds for l-exclusion
DISC'11 Proceedings of the 25th international conference on Distributed computing
Brief announcement: leaderless byzantine paxos
DISC'11 Proceedings of the 25th international conference on Distributed computing
Byzantizing paxos by refinement
DISC'11 Proceedings of the 25th international conference on Distributed computing
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Byzantine agreement using partial authentication
DISC'11 Proceedings of the 25th international conference on Distributed computing
Experimental evaluation of a failure detection service based on a gossip strategy
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Correctness of Gossip-Based Membership under Message Loss
SIAM Journal on 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
When consensus meets self-stabilization
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Gathering asynchronous mobile robots with inaccurate compasses
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
A topological condition for solving fair exchange in byzantine environments
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Spirits: using virtualization and pervasiveness to manage mobile robot software systems
SelfMan'06 Proceedings of the Second IEEE international conference on Self-Managed Networks, Systems, and Services
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On fractional dynamic faults with threshold
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Revisiting the election problem in asynchronous distributed systems
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Stabilizing consensus in mobile networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
The notion of veto number for distributed agreement problems
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Formal proof of impossibility of reliability in crashing protocols
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Optimistic asynchronous atomic broadcast
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Asynchronous perfectly secure communication over one-time pads
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Analysis of mobile agents’ fault-tolerant behavior
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Group communication: from practice to theory
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Solving election problem in asynchronous distributed systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The election problem in asynchronous distributed systems with bounded faulty processes
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Optimal and practical WAB-based consensus algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Less is more: consensus gaps between restricted and unrestricted objects
DISC'06 Proceedings of the 20th international conference on Distributed Computing
One-step consensus solvability
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Middleware for implementing hard real-time systems
Embedded Systems Design
Optimal resilience asynchronous approximate agreement
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Lock-Free parallel algorithms: an experimental study
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
A secure checkpointing protocol for survivable server design
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Adaptive voting for balancing data integrity with availability
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
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
Building and using quorums despite any number of process of crashes
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Failure detection with booting in partially synchronous systems
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
An architectural framework for detecting process hangs/crashes
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
An improved algorithm for adaptive condition-based consensus
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Majority and unanimity in synchronous networks with ubiquitous dynamic faults
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
A formal model for fault-tolerance in distributed systems
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
Public-key cryptography and availability
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
Performance tuning of failure detectors in wireless ad-hoc networks: modelling and experiments
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Revisiting failure detection and consensus in omission failure environments
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
On conspiracies and hyperfairness in distributed computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Obstruction-Free algorithms can be practically wait-free
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Computing with reads and writes in the absence of step contention
DISC'05 Proceedings of the 19th international conference on Distributed Computing
(Almost) all objects are universal in message passing systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Generating fast atomic commit from hyperfast consensus
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
QoS self-configuring failure detectors for distributed systems
DAIS'10 Proceedings of the 10th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Randomized wait-free consensus using an atomicity assumption
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Optimal randomized fair exchange with secret shared coins
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Asynchronous and fully self-stabilizing time-adaptive majority consensus
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Implementing reliable distributed real-time systems with the Θ-model
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Proactive leader election in asynchronous shared memory systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
A flexible framework for secret handshakes
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Architecting Dependable Systems III
Dependable Systems
Dependable peer-to-peer systems withstanding dynamic adversarial churn
Dependable Systems
Rigorous fault tolerance using aspects and formal methods
Rigorous Development of Complex Fault-Tolerant Systems
No double discount: Condition-based simultaneity yields limited gain
Information and Computation
Reliable scientific service compositions
ICSOC'06 Proceedings of the 4th international conference on Service-oriented computing
Replication techniques for availability
Replication
Modular approach to replication for availability
Replication
State machine replication with byzantine faults
Replication
Beyond nash equilibrium: solution concepts for the 21st century
GameSec'11 Proceedings of the Second international conference on Decision and Game Theory for Security
Divide and concur: employing chandra and toueg's consensus algorithm in a multi-level setting
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
The committee decision problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and Distributed Computing
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Fused state machines for fault tolerance in distributed systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Byzantine fault-tolerance with commutative commands
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Solving the at-most-once problem with nearly optimal effectiveness
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
On the implementation of concurrent objects
Dependable and Historic Computing
Secure message transmission in asynchronous directed graphs
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Asynchronous failed sensor node detection method for sensor networks
International Journal of Network Management
Timeout-based adaptive consensus: improving performance through adaptation
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Integrated approach to open distributed management
Computer Communications
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
Research: Design and analysis of an efficient and reliable atomic multicast protocol
Computer Communications
K---Resilient server synchronization protocol for session guarantees in MANET environments
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
An agreement protocol to handle byzantine failures in authenticated hierarchical configuration
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
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
Enabling Application Resilience with and without the MPI Standard
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Faster randomized consensus with an oblivious adversary
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
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
A closer look at fault tolerance
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the (limited) power of non-equivocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the price of equivocation in byzantine agreement
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Brief announcement: tolerating permanent and transient value faults
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Iterative approximate byzantine consensus in arbitrary directed graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Strongly linearizable implementations: possibilities and impossibilities
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
A proposed architecture for a fault tolerant multi agents system using extern agents
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
K-resilient session guarantees synchronization protocol for mobile ad-hoc networks
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A message service for opportunistic computing in disconnected MANETs
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Pushouts in software architecture design
Proceedings of the 11th International Conference on Generative Programming and Component Engineering
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
ShadowDB: a replicated database on a synthesized consensus core
HotDep'12 Proceedings of the Eighth USENIX conference on Hot Topics in System Dependability
Modeling and validating the performance of atomic broadcast algorithms in high latency networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Looking for a definition of dynamic distributed systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Weakening failure detectors for k-set agreement via the partition approach
DISC'07 Proceedings of the 21st international conference on Distributed Computing
From crash-stop to permanent omission: automatic transformation and weakest failure detectors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On the message complexity of indulgent consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Output stability versus time till output
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Automatic classification of eventual failure detectors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Eventually perfect failure detectors using ADD channels
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Exploiting partitioned synchrony to implement accurate failure detectors
International Journal of Critical Computer-Based Systems
From a store-collect object and Ω to efficient asynchronous consensus
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Non-blocking atomic commitment in asynchronous distributed systems with faulty processes
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Scalable byzantine agreement with a random beacon
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Formal verification of distributed algorithms: from pseudo code to checked proofs
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Computability in distributed computing: a Tutorial
ACM SIGACT News
Controller and estimator for dynamic networks
Information and Computation
CScale: a programming model for scalable and reliable distributed applications
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
The strong at-most-once problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Brief announcement: anonymity, failures, detectors and consensus
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Fault tolerance via idempotence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enhancing group communication with self-manageable behavior
Journal of Parallel and Distributed Computing
Multicasting in the presence of aggregated deliveries
Journal of Parallel and Distributed Computing
Survey On reliability in publish/subscribe services
Computer Networks: The International Journal of Computer and Telecommunications Networking
MoSQL: an elastic storage engine for MySQL
Proceedings of the 28th Annual ACM Symposium on Applied Computing
On deterministic abortable objects
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Byzantine vector consensus in complete graphs
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Byzantine renaming in synchronous systems with t
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Multidimensional approximate agreement in Byzantine asynchronous systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Byzantine agreement in polynomial expected time: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Distributing trusted third parties
ACM SIGACT News
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Towards practical communication in Byzantine-resistant DHTs
IEEE/ACM Transactions on Networking (TON)
A survey on reliability in distributed systems
Journal of Computer and System Sciences
Theoretical Computer Science
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
There is more consensus in Egalitarian parliaments
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Leveraging sharding in the design of scalable replication protocols
Proceedings of the 4th annual Symposium on Cloud Computing
Lifecycle of adaptive agreements: a pattern language
AT'13 Proceedings of the Second international conference on Agreement Technologies
On the power of breakable objects
Theoretical Computer Science
On the scalability of snapshot isolation
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Proceedings of the Industrial Track of the 13th ACM/IFIP/USENIX International Middleware Conference
A non-topological proof for the impossibility of k-set agreement
Theoretical Computer Science
An infrastructure for accurate characterization of single-event transients in digital circuits
Microprocessors & Microsystems
Computing with infinitely many processes
Information and Computation
Quorum-based mutual exclusion in asynchronous distributed systems with unreliable failure detectors
The Journal of Supercomputing
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 0.12 |
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the “Byzantine Generals” problem.