Research Interests
Approximation algorithms, algorithmic game theory, and networking.

Publications
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
with V.S. Kumar, R. Rajaraman, and R. Sundaram
Submitted to Infocom 2010
[submitted version]

Approximation Algorithms for Key Management in Secure Multicast
with A. Chan, R. Rajaraman, and F. Zhu
In proceedings of COCOON 2009
[conference version] [full version] [presentation]

Courses Taken
2009Spring
CSG399 Gems of Theoretical Computer Science (Prof. Viola)
MTHG341 Probability 2 (Prof. Gutmann)

2008Fall
CSG195 Applications of Information Theory to Computer Science (Prof. Aslam)

2008Spring
CSG712 Intensive Computer Systems (Prof. Wand)
CSG359 Networking Algorithms (Prof. Sundaram)
MTHG342 Mathematical Statistics (Prof. Ding)

2007Fall
CSG399 Special Topics in Theoretical Computer Science (Prof. Rajaraman)
CSG711 Intensive Principles of Programming Languages (Prof. Wand)
MTHG241 Probability 1 (Prof. Gutmann)

2007Spring
CSG250 Wireless Networks (Prof. Rajaraman)
CSG714 Theory of Computation (Prof. Pucella)
MTHG232 Combinatorial Analysis (Prof. Schulte)

2006Fall
CSG150 Fundamentals of Computer Networks (Prof. Sundaram)
CSG713 Advanced Algorithms (Prof. Aslam)