| vqsgd: Vector quantized stochastic gradient descent V Gandikota, D Kane, RK Maity, A Mazumdar IEEE Transactions on Information Theory 68 (7), 4573-4587, 2022 | 61 | 2022 |
| vqsgd: Vector quantized stochastic gradient descent V Gandikota, D Kane, RK Maity, A Mazumdar International Conference on Artificial Intelligence and Statistics, 2197-2205, 2021 | 60 | 2021 |
| Nearly optimal sparse group testing V Gandikota, E Grigorescu, S Jaggi, S Zhou IEEE Transactions on Information Theory 65 (5), 2760-2773, 2019 | 45 | 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 | 21 | 2021 |
| Superset technique for approximate recovery in one-bit compressed sensing L Flodin, V Gandikota, A Mazumdar Advances in Neural Information Processing Systems 32, 2019 | 17 | 2019 |
| 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 |
| 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 | 9 | 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 | 8 | 2021 |
| Deciding orthogonality in Construction-A lattices K Chandrasekaran, V Gandikota, E Grigorescu SIAM Journal on Discrete Mathematics 31 (2), 1244-1262, 2017 | 8 | 2017 |
| Reliable distributed clustering with redundant data assignment V Gandikota, A Mazumdar, AS Rawat 2020 IEEE International Symposium on Information Theory (ISIT), 2556-2561, 2020 | 3 | 2020 |
| Lattice-based locality sensitive hashing is optimal K Chandrasekaran, D Dadush, V Gandikota, E Grigorescu arXiv preprint arXiv:1712.08558, 2017 | 3 | 2017 |
| 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 |
| 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 | 2 | 2021 |
| Local testing of lattices K Chandrasekaran, M Cheraghchi, V Gandikota, E Grigorescu SIAM Journal on Discrete Mathematics 32 (2), 1265-1295, 2018 | 2 | 2018 |
| Local testing for membership in lattices K Chandrasekaran, M Cheraghchi, V Gandikota, E Grigorescu arXiv preprint arXiv:1608.00180, 2016 | 2 | 2016 |
| 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015) MS Charikar, A Bouajjani, M Emmi, C Enea, J Hamza, J Worrell, B Barak, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2015 | 1 | 2015 |
| Combinatorial Group Testing in Presence of Deletions V Gandikota, N Polyanskii, H Yang arXiv preprint arXiv:2310.09613, 2023 | | 2023 |
| 1-Bit Compressed Sensing with Local Sparsity Patterns S Bulusu, V Gandikota, PK Varshney 2023 IEEE International Symposium on Information Theory (ISIT), 1172-1177, 2023 | | 2023 |
| Optimization using Parallel Gradient Evaluations on Multiple Parameters Y Chandak, S Shankar, V Gandikota, PS Thomas, A Mazumdar arXiv preprint arXiv:2302.03161, 2023 | | 2023 |
Elena GrigorescuPurdue University在 purdue.edu 的电子邮件经过验证
