| vqsgd: Vector quantized stochastic gradient descent V Gandikota, D Kane, RK Maity, A Mazumdar International Conference on Artificial Intelligence and Statistics, 2197-2205, 2021 | 72 | 2021 |
| Nearly optimal sparse group testing V Gandikota, E Grigorescu, S Jaggi, S Zhou IEEE Transactions on Information Theory 65 (5), 2760-2773, 2019 | 35 | 2019 |
| Relaxed locally correctable codes in computationally bounded channels J Blocki, V Gandikota, E Grigorescu, S Zhou IEEE Transactions on Information Theory 67 (7), 4338-4360, 2021 | 16 | 2021 |
| 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 | 16 | 2015 |
| NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem V Gandikota, B Ghazi, E Grigorescu 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 14 | 2016 |
| Superset technique for approximate recovery in one-bit compressed sensing L Flodin, V Gandikota, A Mazumdar Advances in Neural Information Processing Systems 32, 2019 | 13 | 2019 |
| Deciding orthogonality in construction-A lattices K Chandrasekaran, V Gandikota, E Grigorescu SIAM Journal on Discrete Mathematics 31 (2), 1244-1262, 2017 | 7 | 2017 |
| Recovery of sparse linear classifiers from mixture of responses V Gandikota, A Mazumdar, S Pal Advances in Neural Information Processing Systems 33, 14688-14698, 2020 | 5 | 2020 |
| Support recovery of sparse signals from a mixture of linear measurements S Pal, A Mazumdar, V Gandikota Advances in Neural Information Processing Systems 34, 19082-19094, 2021 | 3 | 2021 |
| Maximally recoverable codes: The bounded case V Gandikota, E Grigorescu, C Thomas, M Zhu 2017 55th Annual Allerton Conference on Communication, Control, and …, 2017 | 3 | 2017 |
| Lattice-based locality sensitive hashing is optimal K Chandrasekaran, D Dadush, V Gandikota, E Grigorescu arXiv preprint arXiv:1712.08558, 2017 | 2 | 2017 |
| Local testing for membership in lattices K Chandrasekaran, M Cheraghchi, V Gandikota, E Grigorescu arXiv preprint arXiv:1608.00180, 2016 | 2 | 2016 |
| Byzantine Resilient Distributed Clustering with Redundant Data Assignment S Bulusu, V Gandikota, A Mazumdar, AS Rawat, PK Varshney 2021 IEEE International Symposium on Information Theory (ISIT), 2143-2148, 2021 | 1 | 2021 |
| Reliable distributed clustering with redundant data assignment V Gandikota, A Mazumdar, AS Rawat 2020 IEEE International Symposium on Information Theory (ISIT), 2556-2561, 2020 | 1 | 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 |
| Optimization using Parallel Gradient Evaluations on Multiple Parameters Y Chandak, S Shankar, V Gandikota, PS Thomas, A Mazumdar OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop), 0 | | |
Elena GrigorescuPurdue UniversityVerified email at purdue.edu
