440 Huntington Avenue
240 West Village H
Boston, MA 02115
ATTN: Rajmohan Rajaraman, 202 WVH
360 Huntington Avenue
Boston, MA 02115
- Approximation algorithms for intractable optimization problems, with a particular interest in network design
- Distributed computing in highly dynamic environments
- Algorithmic game theory
- PhD in Computer Science, University of Texas at Austin
- BS in Computer Science, IIT Kanpur, India
Rajmohan Rajaraman is a professor in the Khoury College of Computer Sciences at Northeastern University, which he joined in 1998. Before joining Northeastern University, Rajaraman was a postdoctoral fellow at the National Science Foundation’s Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) in New Jersey. After earning his Bachelor’s in Computer Science at IIT Kanpur in India, he pursued his PhD in computer science at the University of Texas at Austin. He worked at Akamai Technologies until 2006, then proceeded to become a visiting research scientist at Google Research until 2013.
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.
Rajaraman was the recipient of an NSF Career Award. 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. He was a co-author of award-winning papers at ACM PODC, IEEE ICDCS, and ACM WiSec. Rajaraman 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.