Interests

Research Interests

I am interested in Theoretical Computer Science, more specifically in Approximation Algorithms and Combinatorial Optimization.

Academic and Research Experience

Computer Science Department, Carnegie Mellon
Graduate Research (Oct, 2007 - present)
Working with Anupam Gupta on some generalizations of processor scheduling and partial vertex cover.

Department of Computer Science and Engineering, IIT Madras
B.Tech Thesis (Dec, 2006 - Apr, 2007)
Worked on the problem of designing deterministic throughput optimal network codes that tolerate failure in one among a set of polynomially many failure patterns, with Prof. C. Pandu Rangan. The thesis is available here.

College of Computer and Info. Sciences, Northeastern University
Summer Research Internship (May, 2006 - July, 2006)
Worked with Prof. Ravi Sundaram, on the problem of bundling goods to maximize revenue, modeling it in a game-theoretic framework. Agents sell their products in bundles (the choice of whom all to bundle with being the strategic actions), and have a mechanism of sharing the profit amongst themselves. We analyzed the (non)existence of Nash Equilibria of such games. We also obtained results on the hardness of the non game-theoretic model. Our results are available here.

Miscellanea

Designed and implemented a web-based Automated Online Programming Contest Judge which was used for conducting the Shaastra Online Programming Contest. The server is running at http://shaastra.iitm.ac.in/~opc06