scientific article; zbMATH DE number 1256711
From MaRDI portal
Publication:4228447
Recommendations
Cited in
(24)- Making asynchronous distributed computations robust to noise
- Reliable communication over highly connected noisy networks
- Interactive non-malleable codes
- Interactive Coding for Interactive Proofs
- Simulating noisy channel interaction (extended abstract)
- Coding for interactive communication
- Making polynomials robust to noise
- scientific article; zbMATH DE number 3881867 (Why is no real title available?)
- A probabilistic approach to some asymptotics in noiseless communication
- scientific article; zbMATH DE number 6866311 (Why is no real title available?)
- Capacity of interactive communication over erasure channels and channels with feedback
- Making Asynchronous Distributed Computations Robust to Channel Noise
- Synchronization strings: channel simulations and interactive coding for insertions and deletions
- scientific article; zbMATH DE number 7564410 (Why is no real title available?)
- Palette-alternating tree codes
- Noisy interactive quantum communication
- Interactive channel capacity
- Fast interactive coding against adversarial noise
- The work of Mark Braverman
- Distributed CONGEST Algorithms against Mobile Adversaries
- The rate of interactive codes is bounded away from 1
- Information dissemination via broadcasts in the presence of adversarial noise
- Interactive coding with unbounded noise
- Computation over the noisy broadcast channel with malicious parties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228447)
