Pages that link to "Item:Q1079947"
From MaRDI portal
The following pages link to Easy impossibility proofs for distributed consensus problems (Q1079947):
Displaying 50 items.
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- On the impact of link faults on Byzantine agreement (Q476176) (← links)
- On information invariants in robotics (Q504012) (← links)
- Multidimensional agreement in Byzantine systems (Q901876) (← links)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- Clock synchronization and the power of broadcasting (Q1176072) (← links)
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809) (← links)
- Space-efficient asynchronous consensus without shared memory initialization (Q1209330) (← links)
- Reliable communication over partially authenticated networks (Q1292432) (← links)
- Efficient agreement using fault diagnosis. (Q1312601) (← links)
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths (Q1343157) (← links)
- Computing on anonymous networks with sense of direction (Q1399995) (← links)
- Improved time bounds for linearizable implementations of abstract data types (Q1627963) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- Approximate agreement under mobile Byzantine faults (Q1755583) (← links)
- Toward an algebraic theory of systems (Q1786609) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Reaching approximate Byzantine consensus with multi-hop communication (Q2013588) (← links)
- The epigenetic consensus problem (Q2117720) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Revisiting asynchronous fault tolerant computation with optimal resilience (Q2166363) (← links)
- An anticipatory protocol to reach fast consensus in multi-agent systems (Q2173957) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Quantum multi-valued Byzantine agreement based on d-dimensional entangled states (Q2280627) (← links)
- Agreement in synchronous networks with ubiquitous faults (Q2382676) (← links)
- Efficient algorithms for anonymous Byzantine agreement (Q2480748) (← links)
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip (Q2637656) (← links)
- Secure consensus with distributed detection via two-hop communication (Q2665414) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- Multiparty Contract Signing Over a Reliable Network (Q2804932) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323) (← links)
- An algorithm for identification of maliciously faulty units (Q4323717) (← links)
- Graph Relabelling Systems (Q4923532) (← links)
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links (Q5137014) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Reaching Approximate Byzantine Consensus with Multi-hop Communication (Q5207895) (← links)
- Fault-tolerant algorithms for tick-generation in asynchronous logic (Q5501934) (← links)
- Fair Exchange Is Incomparable to Consensus (Q5505613) (← links)
- The Kronecker product and local computations in graphs (Q5878897) (← links)
- Efficient reliable communication over partially authenticated networks (Q5917936) (← links)
- Wait-free approximate agreement on graphs (Q5918635) (← links)
- Byzantine agreement with homonyms (Q5920298) (← links)
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models (Q6074651) (← links)
