Assistant Professor of Computer Science
Joined department in 2002
Education:
BTech, Computer Science
Indian Institute of Technology at Madras (1994)
Indian Institute of Technology at Madras (1994)
MS, Computer Science
State University of New York at Albany (1997)
State University of New York at Albany (1997)
PhD, Computer Science
Brown University (2002)
Brown University (2002)
Professor Pandurangan's research interests are broadly in design and analysis of algorithms and its applications to networks. He is interested in randomized algorithms and stochastic analysis, distributed computing and algorithms, communication networks (especially wireless networks, sensor networks, and peer-to-peer networks), modeling and algorithmic issues in real-world networks (including Internet/Web and social networks), and computational biology.
Selected Publications
M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar, "Efficient Distributed Approximation
Algorithms via Probabilistic Tree Embeddings", Proceedings of the ACM Symposium on Principles of
Distributed Computing (PODC), 2008.
M. Khan and G. Pandurangan, "A Fast Distributed Approximation Algorithm for Minimum Spanning Trees",
Distributed Computing, vol. 20, 2008, 391-402,(Invited paper), 20th
International Symposium on Distributed Computing (DISC), 2006. (Best Student Paper
Award).
G. Pandurangan and G. Park, "Analysis of Randomized Protocols for Conflict-Free Distributed Access",
Algorithmica, Volume 49, No. 2, pp. 109-126, 2007.
Last Updated: May 02, 2008 02:48pm
