Rajmohan Rajaraman

Research interests

• Approximation algorithms for intractable optimization problems
• Network design
• Distributed computing in dynamic environments
• Algorithmic game theory

Education

• PhD in Computer Science, University of Texas at Austin
• BS in Computer Science, IIT Kanpur — India

Biography

Rajmohan Rajaraman is a professor and the associate dean of faculty affairs in the Khoury College of Computer Sciences at Northeastern University, based in Boston.

Rajaraman’s contributions to the field have been widely cited, specifically his research on distributed hash tables, which has been incorporated in peer-to-peer systems. He has obtained important results for fundamental combinatorial optimization problems, including facility location, edge-disjoint paths, and dominating sets. He is a faculty member of the Algorithms and Theory group at Northeastern and hosts a theory seminar.

Before joining Northeastern in 1998, Rajaraman was a postdoctoral fellow at the National Science Foundation’s Center for Discrete Mathematics and Theoretical Computer Science in New Jersey.  He worked at Akamai Technologies until 2006, then became a visiting research scientist at Google Research until 2013.

Rajaraman has earned an NSF Career Award, as well as paper awards at ACM PODC, IEEE ICDCS, and ACM WiSec. He has served as the program chair and track chair for leading conferences in parallel computing and distributed systems, including DCOSS, SPAA, IPDPS, and SSS, and has also served on the program committees of top conferences in theoretical computer science, distributed computing, and networking, including SODA, PODC, FOCS, and Mobihoc. He is an associate editor of the journal Theory of Computing Systems.

Labs and groups

• Algorithms and Theory

Projects

Recent publications