| A refined approximation for Euclidean k-means F Grandoni, R Ostrovsky, Y Rabani, LJ Schulman, R Venkat Information Processing Letters 176, 106251, 2022 | 18 | 2022 |
| Multiplayer parallel repetition for expander games I Dinur, P Harsha, R Venkat, H Yuen ITCS 2017, 2016 | 17 | 2016 |
| On fortification of projection games A Bhangale, R Saptharishi, G Varma, R Venkat RANDOM 2015, 2015 | 8 | 2015 |
| Planted Models for -way Edge and Vertex Expansion A Louis, R Venkat arXiv preprint arXiv:1910.08889, 2019 | 7 | 2019 |
| Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery A Louis, R Venkat ICALP 2018 (To Appear), 2018 | 6 | 2018 |
| Hypergraph two-coloring in the streaming model J Radhakrishnan, S Shannigrahi, R Venkat arXiv preprint arXiv:1512.04188, 2015 | 5 | 2015 |
| Guruswami-Sinop rounding without higher level Lasserre A Deshpande, R Venkat APPROX 2014, 2014 | 4 | 2014 |
| 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) JR Lee, I Panageas, G Piliouras, Z Allen-Zhu, L Orecchia, T Kaufman, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 2 | 2017 |
| Embedding approximately low-dimensional metrics into A Deshpande, P Harsha, R Venkat FSTTCS 2016, 2016 | 1 | 2016 |
| Evaluation of Local Search methods for the Maximum Cut problem SD Ampabathini, R Venkat Indian Institute of Technology, Hyderabad, 2022 | | 2022 |
| A refined approximation for Euclidean k-means R Venkat Elsevier BV, 2022 | | 2022 |
| Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low-Dimensional Spaces Y Rabani, R Venkat APPROX 2017, 2017 | | 2017 |
| On Sparsest Cut and Parallel Repetition R Venkat Mumbai, 0 | | |
| Embedding Approximately Low-Dimensional ℓ2 A Deshpande, P Harsha, R Venkat | | |
