| Augmenting max-weight with explicit learning for wireless scheduling with switching costs S Krishnasamy, PT Akhil, A Arapostathis, R Sundaresan, S Shakkottai IEEE/ACM Transactions on Networking 26 (6), 2501-2514, 2018 | 46 | 2018 |
| A computationally efficient approach to warp factor estimation in VTLN using EM algorithm and sufficient statistics PT Akhil, SP Rath, S Umesh, DR Sanand Ninth Annual Conference of the International Speech Communication Association, 2008 | 25 | 2008 |
| DR sanand,“ PT Akhil, SP Rath, S Umesh A Computationally Efficient Approach to Warp Factor Estimation in VTLN Using …, 2008 | 8 | 2008 |
| Algorithms for separable convex optimization with linear ascending constraints PT Akhil, R Sundaresan Sādhanā 43 (9), 1-18, 2018 | 7 | 2018 |
| A polymatroid approach to separable convex optimization with linear ascending constraints PT Akhil, R Singh, R Sundaresan 2014 Twentieth National Conference on Communications (NCC), 1-5, 2014 | 5 | 2014 |
| A mean-field approach for controlling singularly perturbed multi-population sis epidemics P Akhil, E Altman, R Sundaresan, P LINCS arXiv preprint arXiv:1902.05713, 2019 | 4 | 2019 |
| Network utility maximization revisited: Three issues and their resolution PT Akhil, R Sundaresan Performance Evaluation 136, 102050, 2019 | 3 | 2019 |
| Network utility maximization revisited:: Three issues and their resolution A PT, R Sundaresan | | 2019 |
| Topics in Network Utility Maximization: Interior Point and Finite-step Methods PT Akhil | | 2018 |
| Separable Convex Optimization with Linear Ascending Constraints PT Akhil, R Sundaresan | | 2016 |
