Pages that link to "Item:Q2817675"
From MaRDI portal
The following pages link to A coding theorem for distributed computation (Q2817675):
Displaying 19 items.
- Authenticated adversarial routing (Q484328) (← links)
- An improvement of the tree code construction (Q845688) (← links)
- Making asynchronous distributed computations robust to noise (Q2010600) (← links)
- Reliable communication over highly connected noisy networks (Q2010609) (← links)
- Noisy beeping networks (Q2105415) (← links)
- Interactive non-malleable codes (Q2175939) (← links)
- Computing in fault tolerant broadcast networks and noisy decision trees (Q3055759) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Binomial coding in distributed arbitration systems (Q3486507) (← links)
- (Q4638071) (← links)
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback (Q4978197) (← links)
- Making Asynchronous Distributed Computations Robust to Channel Noise (Q4993319) (← links)
- (Q5002843) (← links)
- (Q5091761) (← links)
- Palette-alternating tree codes (Q5092459) (← links)
- Capacity Theorems for Distributed Index Coding (Q5124455) (← links)
- Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning (Q5134910) (← links)
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation (Q5369877) (← links)
- Distributed computations in fully-defective networks (Q6091854) (← links)