Venkata Gandikota
Title
Cited by
Cited by
Year
Nearly optimal sparse group testing
V Gandikota, E Grigorescu, S Jaggi, S Zhou
IEEE Transactions on Information Theory 65 (5), 2760-2773, 2019
192019
vqSGD: Vector quantized stochastic gradient descent
V Gandikota, D Kane, RK Maity, A Mazumdar
arXiv preprint arXiv:1911.07971, 2019
172019
NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem
V Gandikota, B Ghazi, E Grigorescu
SIAM Journal on Computing 47 (4), 1547-1584, 2018
112018
On the NP-hardness of bounded distance decoding of Reed-Solomon codes
V Gandikota, B Ghazi, E Grigorescu
2015 IEEE International Symposium on Information Theory (ISIT), 2904-2908, 2015
102015
Relaxed locally correctable codes in computationally bounded channels
J Blocki, V Gandikota, E Grigorescu, S Zhou
2019 IEEE International Symposium on Information Theory (ISIT), 2414-2418, 2019
72019
Deciding orthogonality in construction-A lattices
K Chandrasekaran, V Gandikota, E Grigorescu
SIAM Journal on Discrete Mathematics 31 (2), 1244-1262, 2017
32017
Superset technique for approximate recovery in one-bit compressed sensing
L Flodin, V Gandikota, A Mazumdar
Advances in Neural Information Processing Systems, 10387-10396, 2019
22019
Lattice-based locality sensitive hashing is optimal
K Chandrasekaran, D Dadush, V Gandikota, E Grigorescu
arXiv preprint arXiv:1712.08558, 2017
22017
Maximally recoverable codes: The bounded case
V Gandikota, E Grigorescu, C Thomas, M Zhu
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
22017
Local testing for membership in lattices
K Chandrasekaran, M Cheraghchi, V Gandikota, E Grigorescu
arXiv preprint arXiv:1608.00180, 2016
22016
Reliable Distributed Clustering with Redundant Data Assignment
V Gandikota, A Mazumdar, AS Rawat
arXiv preprint arXiv:2002.08892, 2020
2020
Recovery of sparse linear classifiers from mixture of responses
V Gandikota, A Mazumdar, S Pal
Advances in Neural Information Processing Systems 33, 2020
2020
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels
J Blocki, V Gandikota, E Grigorescu, S Zhou
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
2018
Local Testing of Lattices
K Chandrasekaran, M Cheraghchi, V Gandikota, E Grigorescu
SIAM Journal on Discrete Mathematics 32 (2), 1265-1295, 2018
2018
Maximally Recoverable Codes: the Bounded Case
C Thomas, V Gandikota, E Grigorescu, M Zhu
2017
Local and Global Computation on Algebraic Data
VSS Gandikota
Purdue University, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–16