Venkata Gandikota

According to our database, Venkata Gandikota authored at least 20 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Combinatorial Group Testing in Presence of Deletions.

Venkata Gandikota, Nikita Polyanskii, Haodong Yang

CoRR, 2023

Optimization using Parallel Gradient Evaluations on Multiple Parameters.

Yash Chandak, Shiv Shankar, Venkata Gandikota, Philip S. Thomas, Arya Mazumdar

CoRR, 2023

1-Bit Compressed Sensing with Local Sparsity Patterns.

Saikiran Bulusu, Venkata Gandikota, Pramod K. Varshney

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

vqSGD: Vector Quantized Stochastic Gradient Descent.

Venkata Gandikota, Daniel Kane, Raj Kumar Maity, Arya Mazumdar

IEEE Trans. Inf. Theory, 2022

2021

Relaxed Locally Correctable Codes in Computationally Bounded Channels.

Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou

IEEE Trans. Inf. Theory, 2021

Support Recovery of Sparse Signals from a Mixture of Linear Measurements.

Soumyabrata Pal, Arya Mazumdar, Venkata Gandikota

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Byzantine Resilient Distributed Clustering with Redundant Data Assignment.

Saikiran Bulusu, Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat, Pramod K. Varshney

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Recovery of sparse linear classifiers from mixture of responses.

Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Reliable Distributed Clustering with Redundant Data Assignment.

Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Nearly Optimal Sparse Group Testing.

Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou

IEEE Trans. Inf. Theory, 2019

vqSGD: Vector Quantized Stochastic Gradient Descent.

Venkata Gandikota, Raj Kumar Maity, Arya Mazumdar

CoRR, 2019

Superset Technique for Approximate Recovery in One-Bit Compressed Sensing.

Larkin Flodin, Venkata Gandikota, Arya Mazumdar

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Local Testing of Lattices.

Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu

SIAM J. Discret. Math., 2018

Lattice-based Locality Sensitive Hashing is Optimal.

Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels.

Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Deciding Orthogonality in Construction-A Lattices.

Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu

SIAM J. Discret. Math., 2017

Maximally recoverable codes: The bounded case.

Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem.

Venkata Gandikota, Badih Ghazi, Elena Grigorescu

Electron. Colloquium Comput. Complex., 2016

Local Testing for Membership in Lattices.

Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu

Electron. Colloquium Comput. Complex., 2016

2015

On the NP-hardness of bounded distance decoding of Reed-Solomon codes.

Venkata Gandikota, Badih Ghazi, Elena Grigorescu

Proceedings of the IEEE International Symposium on Information Theory, 2015