Publication
Algorithms
Video
All Pairs Shortest Path in Quadratic Time with High Probability
All-pairs shortest path problem is one of the most important, and most studied algorithmic graph problems. For this problem many researches develop algorithms which work well on random instances, most notably complete directed graphs on…
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