|
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
My research interests are broadly in design and analysis of algorithms with applications to distributed computing, network algorithms, and computational biology. I am 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.
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 : Graduated in Dec. 2007.
Co-advised with Prof. Hu (ECE). 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
Research Grants
Efficient Distributed Approximation Algorithms. PI: G. Pandurangan.
National Science Foundation (NSF), Theoretical Foundations (TF) program.
Random Graph Approach to Protein Structure Determination. PI: G.
Pandurangan. Purdue Research Foundation.
Engineering Sensor Networks via Random Graph Theory.
PI: G. Pandurangan. Purdue Research Foundation; Summer Faculty Research
Award.
Random Graph Approach to Protein Structure Determination. PI: G.
Pandurangan. Purdue Research Foundation.
Selected Talks
Energy-efficient Distributed Algorithms for Wireless Ad hoc Networks .
The IEEE 22nd Annual Computer Communications Workshop (CCW), 2008,
Steamboat Springs, CO.
Efficient Distributed Approximation Algorithms. Presented at
Microsoft Research (India), Indian Institute of Science, Bangalore, and University of Illinois at Urbana Champaign, 2008.
Efficient Distributed Approximation Algorithms for Minimum Spanning Trees. Presented at Harvard University, Carnegie-Mellon University, Brown
University, Dartmouth College, Ohio State University, SUNY Albany, Indian Institute of Science, Indiana University-Purdue University (IUPUI),
Microsoft Research (Silicon Valley, USA and Bangalore, India), and Bell Labs, India, 2007.
Complexity of Combinatorial Optimization in Power-Law Graphs,
Invited talk at the SIAM Conference on Discrete Mathematics, 2006.
A Random Graph Approach to Protein Structure Determination ,
DIMACS Workshop on Biomolecular Networks,
DIMACS Center, Rutgers University, 2005.
Entropy-based Bounds for Online Algorithms, Invited talk at the 38th Annual Conference on Information Sciences and Systems(CISS),
Princeton University, NJ, 2004.
Random Graphs in Peer-to-Peer Networks
2nd Bertinoro Workshop on Random(ized) Graphs and Algorithms , Bertinoro, Italy, 2003, and
9th Seminar on the Analysis of Algorithms ,
San Miniato-Pisa, Italy, 2003.
Protocols for Building Low-Diameter P2P Networks,
DIMACS Workshop on Internet and WWW Measurement, Mapping and
Modeling, Rutgers University, NJ, 2002.
Recent Program Committees
The IEEE 22nd Annual Computer Communications Workshop (CCW), 2008,
Steamboat Springs, CO.
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
Distributed Network Algorithms ( Fall 2007)
Theory of Computation and Computational Complexity (Spring 2007,
Spring 2005)
Introduction to the Analysis of Algorithms (undergraduate) (Spring 2008, Fall 2006 )
Randomized Algorithms and Probabilistic Techniques in CS (Fall 2005, Spring 2004)
Algorithm Design, Analysis, and Implementation (graduate) (Fall 2008, Spring 2006, Fall 2004 , Fall 2002)
Introduction to Simulation and Modeling of Computer Systems ( Fall 2003 )
Algorithms for Communications Networks (Spring 2003 )
