| Private coded caching V Ravindrakumar, P Panda, N Karamchandani, VM Prabhakaran IEEE Transactions on Information Forensics and Security 13 (3), 685-694, 2017 | 59 | 2017 |
| Maxing and ranking with few assumptions M Falahatgar, Y Hao, A Orlitsky, V Pichapati, V Ravindrakumar Advances in Neural Information Processing Systems 30, 2017 | 53 | 2017 |
| The limits of maxing, ranking, and preference learning M Falahatgar, A Jain, A Orlitsky, V Pichapati, V Ravindrakumar International conference on machine learning, 1427-1436, 2018 | 40 | 2018 |
| Fundamental limits of secretive coded caching V Ravindrakumar, P Panda, N Karamchandani, V Prabhakaran 2016 IEEE International Symposium on Information Theory (ISIT), 425-429, 2016 | 34 | 2016 |
| Robust estimation algorithms don't need to know the corruption level A Jain, A Orlitsky, V Ravindrakumar arXiv preprint arXiv:2202.05453, 2022 | 11 | 2022 |
| Surf: A simple, universal, robust, fast distribution learning algorithm Y Hao, A Jain, A Orlitsky, V Ravindrakumar Advances in Neural Information Processing Systems 33, 10881-10890, 2020 | 9 | 2020 |
| TURF: Two-Factor, Universal, Robust, Fast Distribution Learning Algorithm Y Hao, A Jain, A Orlitsky, V Ravindrakumar International Conference on Machine Learning, 8427-8445, 2022 | | 2022 |
Ayush JainResearcher, Granica.aiVerified email at ucsd.edu