The following pages link to The Byzantine Generals Problem (Q3942378):
Displaying 50 items.
- Agreement under faulty interfaces (Q293206) (← links)
- Unconditionally secure quantum signatures (Q296340) (← links)
- Visiting Byzantine Agreement underlying ad hoc environment (Q367989) (← links)
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission (Q391242) (← links)
- Byzantine agreement with homonyms in synchronous systems (Q391249) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- On the performance of a retransmission-based synchronizer (Q392190) (← links)
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- On Byzantine generals with alternative plans (Q436889) (← links)
- Self-stabilizing Byzantine asynchronous unison (Q455967) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Learning and teaching ``what is mathematics'' (Q507005) (← links)
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- Determining majority in networks with local interactions and very small local memory (Q518677) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Mutual information reconciliation in non-fully connected heterogeneous multicomputer computational systems (Q612038) (← links)
- Deterministic secure positioning in wireless sensor networks (Q638507) (← links)
- A new solution for the Byzantine agreement problem (Q645812) (← links)
- Threshold protocols in survivor set systems (Q661005) (← links)
- Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
- The complexity of almost-optimal simultaneous coordination (Q675301) (← links)
- Distributed fault detection and isolation of continuous-time non-linear systems (Q693695) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
- Synchronous consensus under hybrid process and link failures (Q719299) (← links)
- Secure and self-stabilizing clock synchronization in sensor networks (Q719301) (← links)
- A necessary condition for Byzantine \(k\)-set agreement (Q738885) (← links)
- Security and privacy aspects in MapReduce on clouds: a survey (Q739007) (← links)
- Simultaneity is harder than agreement (Q757014) (← links)
- Automated analysis of fault-tolerance in distributed systems (Q816197) (← links)
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- On the design of cryptographic primitives (Q850775) (← 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)
- Tight bound on mobile Byzantine agreement (Q897904) (← links)
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- On the complexity of asynchronous agreement against powerful adversaries (Q901869) (← links)
- Multidimensional agreement in Byzantine systems (Q901876) (← links)
- The incremental agreement (Q963429) (← links)
- Game authority for robust and scalable distributed selfish-computer systems (Q974739) (← links)
- P systems and the Byzantine agreement (Q987968) (← links)
- Refined quorum systems (Q992512) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Models of closed multimachine computer systems with transient-fault-tolerance and fault-tolerance on the basis of replication under byzantine faults (Q1027704) (← links)
- Automating the addition of fault tolerance with discrete controller synthesis (Q1041296) (← 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)
