Ravi Sundaram
Professor

Research interests
- Networks
- Algorithms
Education
- PhD in Electrical Engineering and Computer Science, Massachusetts Institute of Technology
- MS in Electrical Engineering and Computer Science, Massachusetts Institute of Technology
- BTech in Computer Science and Engineering, Indian Institute of Technology — India
Biography
Ravi Sundaram is a professor in the Khoury College of Computer Sciences at Northeastern University, based in Boston.
Sundaram is primarily interested in network performance and approximation algorithms for the design and efficient use of networks. He enjoys devising efficient schemes to improve the performance of network-based applications and validating their use through innovative systems implementations. Additionally, Sundaram is interested in network security and game theoretic aspects of network usage, and has previously worked in complexity theory and combinatorics.
Prior to joining Northeastern in 2003, Sundaram worked as a director of engineering at Akamai Technologies, where he played a critical role building out the world’s leading content delivery network. There, he established the mapping group responsible for directing over 10 billion browser requests per day to the optimal Akamai server.
Recent publications
-
Online Paging with Heterogeneous Cache Slots
Citation: Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young. (2022). Online Paging with Heterogeneous Cache Slots CoRR, abs/2206.05579. https://doi.org/10.48550/arXiv.2206.05579 -
PAC-Learning for Strategic Classification
Citation: Ravi Sundaram, Anil Vullikanti, Haifeng Xu, Fan Yao. (2021). PAC-Learning for Strategic Classification ICML, 9978-9988. http://proceedings.mlr.press/v139/sundaram21a.html -
Realization problems on reachability sequences
Citation: Matthew Dippel, Ravi Sundaram, Akshar Varma. (2021). Realization problems on reachability sequences Theor. Comput. Sci., 866, 1-13. https://doi.org/10.1016/j.tcs.2021.02.034