|
Gopal Pandurangan
Assistant Professor of Computer Science
|
Biographical Information
Address
Purdue University
Department of Computer Science
305 N. University Street
West Lafayette, Indiana, 47907-2107
Office Phone: +1 765-494-0916
FAX: +1 765-494-0739
Research Interests
My research interests are broadly in design and analysis of algorithms and its applications to networks. I am
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.
Lab
Network Algorithms and Analysis Laboratory (NAAL)
Ph.D. Students
Dr. Maleq Khan : Graduated in Aug. 2007, Currently Post-doc at the Network Dynamics and Simulation Science Laboratory, VBI, Virginia Tech.
Dissertation: Distributed Approximation Algorithms for Minimum Spanning Trees and Other Related Problems with Applications to Wireless Ad Hoc Networks.
Dr. Jen-Yeu Chen (Joint with Prof. Hu, ECE) : Graduated in Dec. 2007, Currently Assistant Professor of Electrical Engineering at National Dong Hwa University, Taiwan.
Dissertation: Distributed Randomized Algorithms for Robust Aggregate Computation in Wireless Sensor Networks.
Vasil Denchev.
The Mathematics Genealogy Project
Recent Program Committees
The 10th International Conference on Distributed Computing and Networking (ICDCN), 2009, Hyderabad, India.
The 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), 2008, Hong Kong, China.
The 4th International Conference on Mobile Ad-hoc and Sensor Networks (MSN'08), China.
International Workshop on Algorithms and Mobile Ad hoc Networks (WAMAN), 2008 (in conjunction with Notere' 2008), Lyon, France.
Teaching
(Lecture notes for most of these courses are publicly available. Please click on the respective course links.)
Distributed Network Algorithms (Fall 2007)
Theory of Computation and Computational Complexity (Spring 2007, Spring 2005)
Introduction to the Analysis of Algorithms (undergraduate) (Fall 2008, Spring 2008, Fall 2006)
Randomized Algorithms and Probabilistic Techniques in CS (Fall 2005, Spring 2004)
Algorithm Design, Analysis, and Implementation (graduate) (Spring 2006, Fall 2004, Fall 2002)
Introduction to Simulation and Modeling of Computer Systems (Fall 2003)
Algorithms for Communications Networks (Spring 2003)