Pages that link to "Item:Q2013588"
From MaRDI portal
The following pages link to Reaching approximate Byzantine consensus with multi-hop communication (Q2013588):
Displaying 10 items.
- Resilient consensus for multi-agent systems subject to differential privacy requirements (Q2280733) (← links)
- Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming (Q2288594) (← links)
- Defending non-Bayesian learning against adversarial attacks (Q2318111) (← links)
- Secure consensus with distributed detection via two-hop communication (Q2665414) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions (Q4969107) (← links)
- Resilient consensus in continuous-time networks with \(\ell\)-hop communication and time delay (Q6161371) (← links)
- Resilient distributed state estimation with multi-hop communication (Q6605953) (← links)
- Resilient leaderless and leader-follower consensus over random networks through \(\ell\)-hop communication (Q6607507) (← links)
- Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions (Q6659191) (← links)
