Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Rakesh Venkat
Observed name:
Venkat, Rakesh
Institution:
Indian Institute of Technology Hyderabad
Observed institutions:
Centre National de la Recherche Scientifique,
Hebrew University of Jerusalem,
Sorbonne Université,
LIP6,
Indian Institute of Technology Hyderabad
ORCID:
0000-0003-0764-4602
Observed ORCID:
0000-0003-0764-4602
OpenAlex ID:
A5029794841
A refined approximation for Euclidean k-means
2022
·
Fabrizio Grandoni
, Rafail Ostrovsky
, et al.
·
Information Processing Letters
·
15
PDF
Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
2018
·
Louis, Anand
, Venkat, Rakesh
·
arXiv (Cornell University)
·
5
PDF
Multiplayer Parallel Repetition for Expanding Games
2017
·
Dinur, Irit
, Harsha, Prahladh
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
Planted Models for $k$-way Edge and Vertex Expansion
2019
·
Louis, Anand
, Venkat, Rakesh
·
NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)
·
4
PDF
Multiplayer parallel repetition for expander games
2016
·
Dinur, Irit
, Harsha, Prahladh
, et al.
·
arXiv (Cornell University)
·
4
PDF
BullsEye : Scalable and Accurate Approximation Framework for Cache Miss Calculation
2022
·
Nilesh Rajendra Shah
, Ashitabh Misra
, et al.
·
ACM Transactions on Architecture and Code Optimization
·
3
PDF
Hypergraph Two-Coloring in the Streaming Model
2015
·
Radhakrishnan, Jaikumar
, Shannigrahi, Saswata
, et al.
·
arXiv (Cornell University)
·
3
PDF
On Fortification of Projection Games
2015
·
Bhangale, Amey
, Saptharishi, Ramprasad
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
Guruswami-Sinop Rounding without Higher Level Lasserre
2014
·
Deshpande, Amit
, Venkat, Rakesh
·
arXiv (Cornell University)
·
2
PDF
Optimal Two-Round Communication Lower Bound for Graph Connectivity via Pointer Chasing
2026
·
Radhakrishnan, Jaikumar
, Reddy, Chaitanya
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces
2017
·
Rabani, Yuval
, Venkat, Rakesh
·
arXiv (Cornell University)
PDF
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1
2016
·
Deshpande, Amit
, Harsha, Prahladh
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Embedding approximately low-dimensional $\ell_2^2$ metrics into $\ell_1$
2015
·
Deshpande, Amit
, Harsha, Prahladh
, et al.
·
arXiv (Cornell University)
PDF
On Fortification of Projection Games
2015
·
Bhangale, Amey
, Saptharishi, Ramprasad
, et al.
·
arXiv (Cornell University)
PDF
On Fortification of General Games
2015
·
Amey Bhangale
, Ramprasad Saptharishi
, et al.
·
arXiv (Cornell University)
Embedding approximately low-dimensional ℓ 2 2 metrics into ℓ 1 .
2015
·
Amit Deshpande
, Prahladh Harsha
, et al.
Show more works
View as search
Works count:
16
Citation count:
43
H-index:
4
I10-index:
1
Year
Topic
Type