Video
Towards Coding for Maximum Errors in Interactive Communication
We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 – epsilon) fraction of all symbols transmitted by the parties are corrupted…
Publication
Private Data Release via Learning Thresholds
Publication
Ranking on Large-Scale Graphs with Rich Metadata
Publication