default search action
Venkata Gandikota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c16]Saikiran Bulusu, Venkata Gandikota
, Pramod K. Varshney:
1-Bit Compressed Sensing with Local Sparsity Patterns. ISIT 2023: 1172-1177 - [i15]Yash Chandak, Shiv Shankar, Venkata Gandikota
Optimization using Parallel Gradient Evaluations on Multiple Parameters. CoRR abs/2302.03161 (2023) - [i14]Venkata Gandikota
Combinatorial Group Testing in Presence of Deletions. CoRR abs/2310.09613 (2023) - 2022
- [j6]Venkata Gandikota
vqSGD: Vector Quantized Stochastic Gradient Descent. IEEE Trans. Inf. Theory 68(7): 4573-4587 (2022) - 2021
- [j5]Jeremiah Blocki
Relaxed Locally Correctable Codes in Computationally Bounded Channels. IEEE Trans. Inf. Theory 67(7): 4338-4360 (2021) - [c15]Venkata Gandikota, Daniel Kane, Raj Kumar Maity, Arya Mazumdar:
vqSGD: Vector Quantized Stochastic Gradient Descent. AISTATS 2021: 2197-2205 - [c14]Saikiran Bulusu, Venkata Gandikota
Byzantine Resilient Distributed Clustering with Redundant Data Assignment. ISIT 2021: 2143-2148 - [c13]Soumyabrata Pal, Arya Mazumdar, Venkata Gandikota:
Support Recovery of Sparse Signals from a Mixture of Linear Measurements. NeurIPS 2021: 19082-19094 - [i13]Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal:
Support Recovery of Sparse Signals from a Mixture of Linear Measurements. CoRR abs/2106.05951 (2021) - 2020
- [c12]Venkata Gandikota
Reliable Distributed Clustering with Redundant Data Assignment. ISIT 2020: 2556-2561 - [c11]Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal:
Recovery of sparse linear classifiers from mixture of responses. NeurIPS 2020 - [i12]Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat:
Reliable Distributed Clustering with Redundant Data Assignment. CoRR abs/2002.08892 (2020) - [i11]Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal:
Recovery of sparse linear classifiers from mixture of responses. CoRR abs/2010.12087 (2020)
2010 – 2019
- 2019
- [j4]Venkata Gandikota
Nearly Optimal Sparse Group Testing. IEEE Trans. Inf. Theory 65(5): 2760-2773 (2019) - [c10]Jeremiah Blocki
Relaxed Locally Correctable Codes in Computationally Bounded Channels. ISIT 2019: 2414-2418 - [c9]Larkin Flodin, Venkata Gandikota, Arya Mazumdar:
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing. NeurIPS 2019: 10387-10396 - [i10]Larkin Flodin, Venkata Gandikota, Arya Mazumdar:
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing. CoRR abs/1910.13971 (2019) - [i9]Venkata Gandikota, Raj Kumar Maity, Arya Mazumdar:
vqSGD: Vector Quantized Stochastic Gradient Descent. CoRR abs/1911.07971 (2019) - 2018
- [j3]Venkata Gandikota
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. SIAM J. Comput. 47(4): 1547-1584 (2018) - [j2]Karthekeyan Chandrasekaran, Mahdi Cheraghchi
Local Testing of Lattices. SIAM J. Discret. Math. 32(2): 1265-1295 (2018) - [c8]Jeremiah Blocki
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. ICALP 2018: 106:1-106:4 - [c7]Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota
Lattice-based Locality Sensitive Hashing is Optimal. ITCS 2018: 42:1-42:18 - [i8]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Relaxed Locally Correctable Codes in Computationally Bounded Channels. CoRR abs/1803.05652 (2018) - 2017
- [b1]Venkata Gandikota:
Local and Global Computation on Algebraic Data. Purdue University, USA, 2017 - [j1]Karthekeyan Chandrasekaran, Venkata Gandikota
Deciding Orthogonality in Construction-A Lattices. SIAM J. Discret. Math. 31(2): 1244-1262 (2017) - [c6]Venkata Gandikota
Maximally recoverable codes: The bounded case. Allerton 2017: 1115-1122 - [i7]Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou:
Nearly Optimal Sparse Group Testing. CoRR abs/1708.03429 (2017) - [i6]Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu:
Lattice-based Locality Sensitive Hashing is Optimal. CoRR abs/1712.08558 (2017) - 2016
- [c5]Venkata Gandikota
Nearly optimal sparse group testing. Allerton 2016: 401-408 - [c4]Venkata Gandikota
NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem. FOCS 2016: 760-769 - [c3]Karthekeyan Chandrasekaran, Mahdi Cheraghchi
Local Testing for Membership in Lattices. FSTTCS 2016: 46:1-46:14 - [i5]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. CoRR abs/1608.00180 (2016) - [i4]Venkata Gandikota, Badih Ghazi, Elena Grigorescu:
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. CoRR abs/1611.03069 (2016) - [i3]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. Electron. Colloquium Comput. Complex. TR16 (2016) - [i2]Venkata Gandikota, Badih Ghazi, Elena Grigorescu:
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c2]Karthekeyan Chandrasekaran, Venkata Gandikota
Deciding Orthogonality in Construction-A Lattices. FSTTCS 2015: 151-162 - [c1]Venkata Gandikota
On the NP-hardness of bounded distance decoding of Reed-Solomon codes. ISIT 2015: 2904-2908 - [i1]Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu:
Deciding Orthogonality in Construction-A Lattices. CoRR abs/1512.02734 (2015)
Coauthor Index
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-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: