| Improved lower bounds for coded caching H Ghasemi, A Ramamoorthy IEEE Transactions on Information Theory 63 (7), 4388-4413, 2017 | 162 | 2017 |
| Improved lower bounds for coded caching H Ghasemi, A Ramamoorthy 2015 IEEE International Symposium on Information Theory (ISIT), 1696-1700, 2015 | 162 | 2015 |
| SRF: Matrix completion based on smoothed rank function H Ghasemi, M Malek-Mohammadi, M Babaie-Zadeh, C Jutten 2011 IEEE International Conference on Acoustics, Speech and Signal …, 2011 | 40 | 2011 |
| Asynchronous Coded Caching H Ghasemi, A Ramamoorthy Available online at https://arxiv.org/abs/1907.06801, 2019 | 18 | 2019 |
| Asynchronous coded caching H Ghasemi, A Ramamoorthy IEEE International Symposium on Information Theory (ISIT), 2438-2442, 2017 | 18 | 2017 |
| Further results on lower bounds for coded caching H Ghasemi, A Ramamoorthy 2016 IEEE International Symposium on Information Theory (ISIT), 2319-2323, 2016 | 13 | 2016 |
| Asynchronous coded caching with uncoded prefetching H Ghasemi, A Ramamoorthy IEEE/ACM Transactions on Networking 28 (5), 2146-2159, 2020 | 10 | 2020 |
| Algorithms for asynchronous coded caching H Ghasemi, A Ramamoorthy 2017 51st Asilomar Conference on Signals, Systems, and Computers, 636-640, 2017 | 8 | 2017 |
| Coded Caching: Information Theoretic Bounds and Asynchronism H Ghasemi Iowa State University, 2019 | 2 | 2019 |
| Online Asynchronous Coded Caching H Ghasemi, A Ramamoorthy | | 2019 |
Aditya RamamoorthyNorthrop Grumman Professor, Department of Electrical and Computer Engineering, Iowa State UniversityVerified email at iastate.edu
