Rakesh Venkat

Orcid: 0000-0003-0764-4602

According to our database1, Rakesh Venkat authored at least 14 papers between 2014 and 2026.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Optimal Two-Round Communication Lower Bound for Graph Connectivity via Pointer Chasing.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2023
BullsEye : Scalable and Accurate Approximation Framework for Cache Miss Calculation.
ACM Trans. Archit. Code Optim., March, 2023

2022
A refined approximation for Euclidean k-means.
Inf. Process. Lett., 2022

2019
Planted Models for k-Way Edge and Vertex Expansion.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Multiplayer Parallel Repetition for Expanding Games.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces.
Proceedings of the Approximation, 2017

2016
Multiplayer parallel repetition for expander games.
Electron. Colloquium Comput. Complex., 2016

Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
On Fortification of General Games.
Electron. Colloquium Comput. Complex., 2015

Hypergraph Two-Coloring in the Streaming Model.
CoRR, 2015

Embedding approximately low-dimensional ℓ<sub>2<sup>2</sup></sub> metrics into ℓ<sub>1</sub>.
CoRR, 2015

On Fortification of Projection Games.
Proceedings of the Approximation, 2015

2014
Guruswami-Sinop Rounding without Higher Level Lasserre.
Proceedings of the Approximation, 2014


  Loading...