Guruswami-Sinop Rounding without Higher Level Lasserre. - Amit Deshpande 001; Rakesh Venkat (APPROX-RANDOM, 2014)

On Fortification of Projection Games. - Amey Bhangale; Ramprasad Saptharishi; Girish Varma; Rakesh Venkat (APPROX-RANDOM, 2015)

Embedding approximately low-dimensional ℓ22 metrics into ℓ1. - Amit Deshpande 001; Prahladh Harsha; Rakesh Venkat (CoRR, 2015)

Hypergraph Two-Coloring in the Streaming Model. - Jaikumar Radhakrishnan; Saswata Shannigrahi; Rakesh Venkat (CoRR, 2015)

On Fortification of General Games. - Amey Bhangale; Ramprasad Saptharishi; Girish Varma; Rakesh Venkat (Electron. Colloquium Comput. Complex., 2015)

Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. - Amit Deshpande 001; Prahladh Harsha; Rakesh Venkat (FSTTCS, 2016)

Multiplayer parallel repetition for expander games. - Irit Dinur; Prahladh Harsha; Rakesh Venkat; Henry Yuen (Electron. Colloquium Comput. Complex., 2016)

Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces. - Yuval Rabani; Rakesh Venkat (APPROX-RANDOM, 2017)

Multiplayer Parallel Repetition for Expanding Games. - Irit Dinur; Prahladh Harsha; Rakesh Venkat; Henry Yuen (ITCS, 2017)

Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. - Anand Louis; Rakesh Venkat (ICALP, 2018)

Planted Models for k-Way Edge and Vertex Expansion. - Anand Louis; Rakesh Venkat (FSTTCS, 2019)

A refined approximation for Euclidean k-means. - Fabrizio Grandoni 001; Rafail Ostrovsky; Yuval Rabani; Leonard J. Schulman; Rakesh Venkat (Inf. Process. Lett., 2022)

BullsEye : Scalable and Accurate Approximation Framework for Cache Miss Calculation. - Nilesh Rajendra Shah; Ashitabh Misra; Antoine Miné; Rakesh Venkat; Ramakrishna Upadrasta (ACM Trans. Archit. Code Optim., 2023)