Venkata Gandikota

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 37

Top Topics

Error Correction

Linear Classifiers

Vector Quantized

Top Venues

IEEE Trans. Inf. Theory

Publications

Venkata Gandikota, Nikita Polyanskii, Haodong Yang
Combinatorial Group Testing in Presence of Deletions. CoRR (2023)
Saikiran Bulusu, Venkata Gandikota, Pramod K. Varshney
1-Bit Compressed Sensing with Local Sparsity Patterns. ISIT (2023)
Yash Chandak, Shiv Shankar, Venkata Gandikota, Philip S. Thomas, Arya Mazumdar
Optimization using Parallel Gradient Evaluations on Multiple Parameters. CoRR (2023)
Venkata Gandikota, Daniel Kane, Raj Kumar Maity, Arya Mazumdar
vqSGD: Vector Quantized Stochastic Gradient Descent. IEEE Trans. Inf. Theory 68 (7) (2022)
Soumyabrata Pal, Arya Mazumdar, Venkata Gandikota
Support Recovery of Sparse Signals from a Mixture of Linear Measurements. NeurIPS (2021)
Saikiran Bulusu, Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat, Pramod K. Varshney
Byzantine Resilient Distributed Clustering with Redundant Data Assignment. ISIT (2021)
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Relaxed Locally Correctable Codes in Computationally Bounded Channels. IEEE Trans. Inf. Theory 67 (7) (2021)
Venkata Gandikota, Daniel Kane, Raj Kumar Maity, Arya Mazumdar
vqSGD: Vector Quantized Stochastic Gradient Descent. AISTATS (2021)
Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal
Support Recovery of Sparse Signals from a Mixture of Linear Measurements. CoRR (2021)
Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat
Reliable Distributed Clustering with Redundant Data Assignment. ISIT (2020)
Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat
Reliable Distributed Clustering with Redundant Data Assignment. CoRR (2020)
Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal
Recovery of sparse linear classifiers from mixture of responses. CoRR (2020)
Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal
Recovery of sparse linear classifiers from mixture of responses. NeurIPS (2020)
Larkin Flodin, Venkata Gandikota, Arya Mazumdar
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing. CoRR (2019)
Larkin Flodin, Venkata Gandikota, Arya Mazumdar
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing. NeurIPS (2019)
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Relaxed Locally Correctable Codes in Computationally Bounded Channels. ISIT (2019)
Venkata Gandikota, Raj Kumar Maity, Arya Mazumdar
vqSGD: Vector Quantized Stochastic Gradient Descent. CoRR (2019)
Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
Nearly Optimal Sparse Group Testing. IEEE Trans. Inf. Theory 65 (5) (2019)
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing of Lattices. SIAM J. Discret. Math. 32 (2) (2018)
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
Lattice-based Locality Sensitive Hashing is Optimal. ITCS (2018)
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Relaxed Locally Correctable Codes in Computationally Bounded Channels. CoRR (2018)
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. ICALP (2018)
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. SIAM J. Comput. 47 (4) (2018)
Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
Deciding Orthogonality in Construction-A Lattices. SIAM J. Discret. Math. 31 (2) (2017)
Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
Nearly Optimal Sparse Group Testing. CoRR (2017)
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
Lattice-based Locality Sensitive Hashing is Optimal. CoRR (2017)
Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu
Maximally recoverable codes: The bounded case. Allerton (2017)
Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
Nearly optimal sparse group testing. Allerton (2016)
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing for Membership in Lattices. FSTTCS (2016)
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing for Membership in Lattices. CoRR (2016)
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing for Membership in Lattices. Electron. Colloquium Comput. Complex. 23 (2016)
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. CoRR (2016)
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. Electron. Colloquium Comput. Complex. 23 (2016)
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem. FOCS (2016)
Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
Deciding Orthogonality in Construction-A Lattices. FSTTCS (2015)
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
On the NP-hardness of bounded distance decoding of Reed-Solomon codes. ISIT (2015)
Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
Deciding Orthogonality in Construction-A Lattices. CoRR (2015)