Pages that link to "Item:Q1342521"
From MaRDI portal
The following pages link to Tolerating a linear number of faults in networks of bounded degree (Q1342521):
Displaying 14 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- Reliable communication over partially authenticated networks (Q1292432) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- Percolation on finite graphs and isoperimetric inequalities. (Q1878979) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- Addendum to ``Scalable secure storage when half the system is faulty'' [inform. comput. 174 (2)(2002) 203-213] (Q2373880) (← links)
- Efficient gossip and robust distributed computation (Q2576871) (← links)
- (Q5743420) (← links)
- Leader Election in Sparse Dynamic Networks with Churn (Q5856444) (← links)
- Efficient reliable communication over partially authenticated networks (Q5917936) (← links)
