Pages that link to "Item:Q5348837"
From MaRDI portal
The following pages link to Tolerating linear number of faults in networks of bounded degree (Q5348837):
Displaying 10 items.
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- Fast consensus in networks of bounded degree. (Q1312604) (← links)
- Agreement in the presence of faults, on networks of bounded degree (Q1351635) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Efficient constructions for almost-everywhere secure computation (Q2119011) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults (Q4268879) (← links)
- Linearly Many Edge-Faults in 2-Bijective Connection Networks (Q4598907) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)