| Sincronia: Near-optimal network design for coflows S Agarwal, S Rajakrishnan, A Narayan, R Agarwal, D Shmoys, A Vahdat Proceedings of the 2018 Conference of the ACM Special Interest Group on Data …, 2018 | 146 | 2018 |
| Lower bounds and optimal protocols for three-party secure computation S Rajakrishnan, A Thangaraj, V Prabhakaran 2016 IEEE International Symposium on Information Theory (ISIT), 1361-1365, 2016 | 4 | 2016 |
| From switch scheduling to datacenter scheduling: Matching-coordinated greed is good R Agarwal, S Rajakrishnan, DB Shmoys Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022 | 2 | 2022 |
| On approximability of optimization problems related to Red/Blue-split graphs S Mishra, S Rajakrishnan, S Saurabh Theoretical Computer Science 690, 104-113, 2017 | 1 | 2017 |
| Approximability of open k-monopoly problems S Mishra, BA Krishna, S Rajakrishnan Theory of Computing Systems 65 (5), 798-814, 2021 | | 2021 |
| The Complexity of Maximum -Order Bounded Component Set Problem S Mishra, S Rajakrishnan arXiv preprint arXiv:1712.02870, 2017 | | 2017 |
| Lower bounds for interactive function computation via Wyner common information S Rajakrishnan, V Prabhakaran 2016 Twenty Second National Conference on Communication (NCC), 1-6, 2016 | | 2016 |
David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceVerified email at cs.cornell.edu
