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 in design and analysis of algorithms, in particular, randomized algorithms and probabilistic analysis of algorithms, with applications to distributed computing, network algorithms, and computational biology. Pandurangan is especially interested in modeling and algorithmic issues in real-world networks including the Internet, Web, peer-to-peer networks, wireless and ad hoc sensor networks, and biological networks.
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.
Funding Administered by Computer Science
Gopal Pandurangan, AF:Small: Collaborative Research: Algorithmic Problems in Protein Structure
Studies, National Science Foundation, 9/1/2009-8/31/2012.
Gopal Pandurangan, Efficient Distributed Approximation Algorithms, National Science
Foundation, 8/1/2008-7/31/2011.
Last Updated: September 02, 2009 02:59pm
