People
Faculty Members
Rajmohan Rajaraman |
 |
Professor Rajaraman's primary research interests are in approximation algorithms, distributed computing, and networks. His ongoing research projects include approximation algorithms for network design problems; protocols for ad hoc wireless and sensor networks; the design of efficient schemes for data organization and retrieval in distributed networks; and competitive online algorithms for scheduling.
Professor Rajaraman earned his Bachelor's in Computer Science from IIT Kanpur and his PhD in Computer Science from the University of Texas at Austin. His dissertation concerned resource sharing in distributed systems. In it, he demonstrated that a number of basic resource-sharing problems admit efficient solutions in the form of simple local algorithms. Before joining the College of Computer Science in fall 1998, Professor Rajaraman was a postdoctoral fellow at the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.
Career Publication Highlights
J. Chen, R. Kleinberg, L. Lovasz, R. Rajaraman, R. Sundaram, and A. Vetta, "(Almost) Tight Bounds and Existence Theorems for Confluent Flows", in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, June 2004.
L. Jia, T. Suel, and R. Rajaraman, "An Efficient Distributed Algorithm for Constructing Small Dominating Sets", Distributed Computing 15:193-205, 2002. Special issue devoted to selected papers from the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC).
M. Korupolu, C. G. Plaxton, and R. Rajaraman, "Analysis of a Local Search Heuristic for Facility Location Problems". Journal of Algorithms37:146--188, 2000. Special issue devoted to selected papers from the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).