Pages that link to "Item:Q4575719"
From MaRDI portal
The following pages link to Towards Optimal Deterministic Coding for Interactive Communication (Q4575719):
Displaying 12 items.
- Making asynchronous distributed computations robust to noise (Q2010600) (← links)
- Interactive non-malleable codes (Q2175939) (← links)
- Towards deterministic tree code constructions (Q2826052) (← links)
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise (Q2968158) (← links)
- Constant-Rate Coding for Multiparty Interactive Communication Is Impossible (Q3177892) (← links)
- Determining Optimal Rates for Communication for Omniscience (Q4566753) (← 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)
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture (Q5009787) (← links)
- Interactive coding over the noisy broadcast channel (Q5230314) (← links)
- Optimal error rates for interactive coding I (Q5259615) (← links)