![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Rakesh Venkat
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j2]Nilesh Rajendra Shah
, Ashitabh Misra
, Antoine Miné
, Rakesh Venkat
, Ramakrishna Upadrasta
:
BullsEye : Scalable and Accurate Approximation Framework for Cache Miss Calculation. ACM Trans. Archit. Code Optim. 20(1): 2:1-2:28 (2023) - 2022
- [j1]Fabrizio Grandoni
, Rafail Ostrovsky, Yuval Rabani
, Leonard J. Schulman
, Rakesh Venkat
:
A refined approximation for Euclidean k-means. Inf. Process. Lett. 176: 106251 (2022) - 2021
- [i11]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A Refined Approximation for Euclidean k-Means. CoRR abs/2107.07358 (2021)
2010 – 2019
- 2019
- [c7]Anand Louis, Rakesh Venkat
:
Planted Models for k-Way Edge and Vertex Expansion. FSTTCS 2019: 23:1-23:15 - [i10]Anand Louis, Rakesh Venkat:
Planted Models for k-way Edge and Vertex Expansion. CoRR abs/1910.08889 (2019) - 2018
- [c6]Anand Louis, Rakesh Venkat
:
Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. ICALP 2018: 101:1-101:15 - [i9]Anand Louis, Rakesh Venkat:
Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. CoRR abs/1805.09747 (2018) - 2017
- [c5]Yuval Rabani, Rakesh Venkat:
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces. APPROX-RANDOM 2017: 21:1-21:14 - [c4]Irit Dinur, Prahladh Harsha
, Rakesh Venkat
, Henry Yuen:
Multiplayer Parallel Repetition for Expanding Games. ITCS 2017: 37:1-37:16 - [i8]Yuval Rabani, Rakesh Venkat:
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low-Dimensional Spaces. CoRR abs/1706.06806 (2017) - 2016
- [c3]Amit Deshpande, Prahladh Harsha
, Rakesh Venkat
:
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. FSTTCS 2016: 10:1-10:13 - [i7]Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen:
Multiplayer parallel repetition for expander games. CoRR abs/1610.08349 (2016) - [i6]Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen:
Multiplayer parallel repetition for expander games. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c2]Amey Bhangale, Ramprasad Saptharishi
, Girish Varma, Rakesh Venkat
:
On Fortification of Projection Games. APPROX-RANDOM 2015: 497-511 - [i5]Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat:
On Fortification of General Games. CoRR abs/1504.05556 (2015) - [i4]Amit Deshpande, Prahladh Harsha, Rakesh Venkat:
Embedding approximately low-dimensional ℓ22 metrics into ℓ1. CoRR abs/1512.04170 (2015) - [i3]Jaikumar Radhakrishnan, Saswata Shannigrahi, Rakesh Venkat:
Hypergraph Two-Coloring in the Streaming Model. CoRR abs/1512.04188 (2015) - [i2]Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat:
On Fortification of General Games. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c1]Amit Deshpande, Rakesh Venkat
:
Guruswami-Sinop Rounding without Higher Level Lasserre. APPROX-RANDOM 2014: 105-114 - [i1]Amit Deshpande, Rakesh Venkat:
Guruswami-Sinop Rounding without Higher Level Lasserre. CoRR abs/1406.7279 (2014)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint