Pages that link to "Item:Q3873545"

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

Displaying 50 items.

• Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time (Q3460716) (← links)
• Secure Protocols with Asymmetric Trust (Q3498386) (← links)
• How to Solve Consensus in the Smallest Window of Synchrony (Q3540219) (← links)
• Continuous Consensus with Failures and Recoveries (Q3540246) (← links)
• No Double Discount: Condition-Based Simultaneity Yields Limited Gain (Q3540247) (← links)
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds (Q4031319) (← links)
• A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (Q4031320) (← links)
• Message-optimal protocols for Byzantine Agreement (Q4031321) (← links)
• The Failure Discovery problem (Q4031322) (← links)
• Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323) (← links)
• An algorithm for identification of maliciously faulty units (Q4323717) (← links)
• (Q5002836) (← links)
• A tight analysis of the parallel undecided-state dynamics with two colors (Q5005128) (← links)
• Back to the Coordinated Attack Problem (Q5006457) (← links)
• On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm (Q5087090) (← links)
• (Q5091085) (← links)
• Correctness of Tendermint-Core Blockchains (Q5091090) (← links)
• (Q5091093) (← links)
• Time is not a healer (Q5096164) (← links)
• Unconditional Byzantine agreement for any number of faulty processors (Q5096793) (← links)
• Optimal time byzantine agreement for t <n/8 with linear-messages (Q5137009) (← links)
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links (Q5137014) (← links)
• Fast timing-based algorithms (Q5137323) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• Randomized protocols for asynchronous consensus (Q5138489) (← links)
• Appraising two decades of distributed computing theory research (Q5138493) (← links)
• Resilient-optimal interactive consistency in constant time (Q5138494) (← links)
• Spatial reference frame agreement in quantum networks (Q5143242) (← links)
• What Can be Computed in a Distributed System? (Q5170751) (← links)
• Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms (Q5175774) (← links)
• Reaching Approximate Byzantine Consensus with Multi-hop Communication (Q5207895) (← links)
• Analysis of the Blockchain Protocol in Asynchronous Networks (Q5267421) (← links)
• Efficient Counting with Optimal Resilience (Q5359491) (← links)
• Continuous Consensus with Ambiguous Failures (Q5445739) (← links)
• On Optimal Probabilistic Asynchronous Byzantine Agreement (Q5445740) (← links)
• Fault-tolerant algorithms for tick-generation in asynchronous logic (Q5501934) (← links)
• (Q5743418) (← links)
• Asynchronous reference frame agreement in a quantum network (Q5854987) (← links)
• Leader Election in Sparse Dynamic Networks with Churn (Q5856444) (← links)
• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
• Consensus in Data Management: From Distributed Commit to Blockchain (Q5886006) (← links)
• Byzantine agreement with homonyms (Q5892120) (← links)
• Structuring unreliable radio networks (Q5892121) (← links)
• Distributed deterministic edge coloring using bounded neighborhood independence (Q5892122) (← links)
• Compact policy routing (Q5892123) (← links)
• Order optimal information spreading using algebraic gossip (Q5892124) (← links)
• A closer look at fault tolerance (Q5895044) (← links)
• Wait-free approximate agreement on graphs (Q5918635) (← links)
• Near-optimal self-stabilising counting and firing squads (Q5919570) (← links)
• Byzantine agreement with homonyms (Q5920298) (← links)