Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. | 0 | 0.34 | 2018 |
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces. | 0 | 0.34 | 2017 |
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. | 0 | 0.34 | 2016 |
Multiplayer parallel repetition for expander games. | 0 | 0.34 | 2016 |
Hypergraph Two-Coloring in the Streaming Model | 0 | 0.34 | 2015 |
On Fortification of Projection Games | 3 | 0.40 | 2015 |
Embedding approximately low-dimensional $\ell_2^2$ metrics into $\ell_1$ | 0 | 0.34 | 2015 |
On Fortification of General Games. | 0 | 0.34 | 2015 |