Pages that link to "Item:Q3873545"
From MaRDI portal
The following pages link to Reaching Agreement in the Presence of Faults (Q3873545):
Displaying 50 items.
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- An axiomatic approach to computing the connectivity of synchronous and asynchronous systems (Q2810958) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A Characterization of Dynamic Networks Where Consensus Is Solvable (Q2868629) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- Coordinated consensus in dynamic networks (Q2943377) (← links)
- Error-free multi-valued consensus with byzantine failures (Q2943378) (← links)
- Distributed graph coloring in a few rounds (Q2943379) (← links)
- MIS on trees (Q2943380) (← links)
- Toward more localized local algorithms (Q2943381) (← links)
- The complexity of robust atomic storage (Q2943384) (← links)
- Resilience of mutual exclusion algorithms to transient memory faults (Q2943385) (← links)
- The impact of memory models on software reliability in multiprocessors (Q2943388) (← links)
- A complexity separation between the cache-coherent and distributed shared memory models (Q2943389) (← links)
- From bounded to unbounded concurrency objects and back (Q2943391) (← links)
- The space complexity of long-lived and one-shot timestamp implementations (Q2943392) (← links)
- Locally checkable proofs (Q2943393) (← links)
- Fault-tolerant spanners (Q2943394) (← links)
- Adaptively secure broadcast, revisited (Q2943395) (← links)
- Scalable rational secret sharing (Q2943397) (← links)
- Analyzing consistency properties for fun and profit (Q2943399) (← links)
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions (Q2943400) (← links)
- Optimal-time adaptive strong renaming, with applications to counting (Q2943401) (← links)
- The round complexity of distributed sorting (Q2943403) (← links)
- A tight unconditional lower bound on distributed randomwalk computation (Q2943404) (← links)
- Minimum congestion mapping in a cloud (Q2943405) (← links)
- Conflict on a communication channel (Q2943406) (← links)
- Xheal (Q2943407) (← links)
- Stability of a peer-to-peer communication system (Q2943409) (← links)
- Tight bounds on information dissemination in sparse mobile networks (Q2943410) (← links)
- Time-efficient randomized multiple-message broadcast in radio networks (Q2943411) (← links)
- Faster information dissemination in dynamic networks via network coding (Q2943412) (← links)
- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms (Q2961576) (← links)
- Revising the Membrane Computing Model for Byzantine Agreement (Q2975922) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults (Q3088334) (← links)
- The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement (Q3095337) (← links)
- Byzantine Agreement Using Partial Authentication (Q3095344) (← links)
- Beyond Nash Equilibrium: Solution Concepts for the 21st Century (Q3098090) (← links)
- Reliable synchronization in distributed systems (Q3154799) (← links)
- What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms (Q3179167) (← links)
- Tight Bounds for Asynchronous Renaming (Q3189653) (← links)
- piChain: When a Blockchain meets Paxos (Q3300800) (← links)
- The Firing Squad Problem Revisited. (Q3304114) (← links)
- Authenticated Byzantine Generals in Dual Failure Model (Q3406476) (← links)
- Broadcast from Minicast Secure Against General Adversaries (Q3449517) (← links)
- Communication Patterns and Input Patterns in Distributed Computing (Q3460703) (← links)
