Pages that link to "Item:Q3873545"

The following pages link to Reaching Agreement in the Presence of Faults (Q3873545):

Displaying 50 items.

• Agreement under faulty interfaces (Q293206) (← links)
• A distributed leader election algorithm in crash-recovery and omissive systems (Q344564) (← links)
• Clone wars: distributed detection of clone attacks in mobile WSNs (Q389398) (← links)
• Byzantine agreement with homonyms in synchronous systems (Q391249) (← links)
• No double discount: condition-based simultaneity yields limited gain (Q418187) (← links)
• Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
• Verifiable secret sharing in a total of three rounds (Q456152) (← links)
• On the impact of link faults on Byzantine agreement (Q476176) (← links)
• A simple characterization of asynchronous computations (Q477089) (← links)
• Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
• Distributed sampled-data control of nonholonomic multi-robot systems with proximity networks (Q510109) (← links)
• A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
• The computability of relaxed data structures: queues and stacks as examples (Q518927) (← links)
• Consensus when all processes may be Byzantine for some time (Q555306) (← links)
• Mutual information reconciliation in non-fully connected heterogeneous multicomputer computational systems (Q612038) (← links)
• Secure message transmission in asynchronous networks (Q635383) (← links)
• A new solution for the Byzantine agreement problem (Q645812) (← links)
• The robustness of stability under link and node failures (Q650924) (← links)
• Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
• The complexity of almost-optimal simultaneous coordination (Q675301) (← links)
• On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
• Consensus algorithms with one-bit messages (Q757011) (← links)
• Invited talk: Resilient distributed algorithms (Q831782) (← links)
• Managed agreement: generalizing two fundamental distributed agreement problems (Q845930) (← links)
• Combination of clock-state and clock-rate correction in fault-tolerant distributed systems (Q853633) (← links)
• Robust gossiping with an application to consensus (Q856404) (← links)
• The perfectly synchronized round-based model of distributed computing (Q879602) (← links)
• Optimal resilient threshold GQ signatures (Q881852) (← links)
• Extracting complexes that ensure sufficient structural conditions for system mutual informational agreement in multicomplex systems (Q891211) (← links)
• Synchronous counting and computational algorithm design (Q896024) (← links)
• Tight bound on mobile Byzantine agreement (Q897904) (← links)
• Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
• On the complexity of asynchronous agreement against powerful adversaries (Q901869) (← links)
• The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (Q916352) (← links)
• Knowledge and common knowledge in a Byzantine environment: Crash failures (Q918186) (← links)
• Fork sequential consistency is blocking (Q976120) (← links)
• Continuous consensus with ambiguous failures (Q986534) (← links)
• Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
• P systems and the Byzantine agreement (Q987968) (← links)
• A simple and communication-efficient omega algorithm in the crash-recovery model (Q990113) (← links)
• Refined quorum systems (Q992512) (← links)
• Implementing the Omega failure detector in the crash-recovery failure model (Q1004284) (← links)
• On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
• Rapid almost-complete broadcasting in faulty networks (Q1008737) (← links)
• Models of closed multimachine computer systems with transient-fault-tolerance and fault-tolerance on the basis of replication under byzantine faults (Q1027704) (← links)
• On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
• How to cope with faulty processors in a completely connected network of communicating processors (Q1060840) (← links)
• On the possibility and impossibility of achieving clock synchronization (Q1077930) (← links)
• Easy impossibility proofs for distributed consensus problems (Q1079947) (← links)
• Serializability theory for replicated databases (Q1083230) (← links)