Professor Rajaraman’s primary research interests lie in approximation algorithms, algorithmic game theory, distributed computing, and networks. His technical contributions include foundational work on distributed hash tables, the new paradigms of universal and incremental approximations, capacity analysis of Internet routing, and approximation algorithms for hard optimization problems. He is a recipient of the National Science Foundation (NSF) Career Award.
Before joining Northeastern University in fall 1998, Professor Rajaraman was a postdoctoral fellow at the NSF’s Center for Discrete Mathematics and Theoretical Computer Science (DIMACS).
The brightest and most innovative in the industry