Pages that link to "Item:Q3763582"
From MaRDI portal
The following pages link to Reaching approximate agreement in the presence of faults (Q3763582):
Displaying 13 items.
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- Secure multi-dimensional consensus algorithm against malicious attacks (Q6073016) (← links)
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey (Q6073106) (← links)
- Bipartite Byzantine‐resilient event‐triggered consensus control of heterogeneous multi‐agent systems (Q6177348) (← links)
- Submodularity-based false data injection attack scheme in multi-agent dynamical systems (Q6192962) (← links)
- Byzantine-resilient distributed observers for LTI systems (Q6200695) (← links)
- Byzantine approximate agreement on graphs (Q6487546) (← links)
- Brief announcement: Reaching approximate consensus when everyone may crash (Q6535052) (← links)
- Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents (Q6551661) (← links)
- Simulating reliable links with unreliable links in the presence of process crashes (Q6570916) (← links)
- The combinatorial structure of wait-free solvable tasks (extended abstract) (Q6570926) (← links)
- Iterative approximate Byzantine consensus in arbitrary directed graphs (Q6601209) (← links)
- Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions (Q6659191) (← links)