I am a member of the Algorithms Group at Microsoft Research India.  My research interests are broadly in theoretical computer science.  I am also interested in algorithmic problems arising directly in practice. 

Recent Publications

• Deterministic algorithms for Lovasz local lemma (with K. Chandrasekaran and B. Haeupler) SODA 2010 arxiv/0908.0375
• Enhanced flux balance analysis to model metabolic networks (with N. Nair and N. Chandra) Supplementary material (code and data)
• Dynamic vs. Oblivious Routing in Network Design (with N. Olver and B. Shepherd) ESA 2009
• Learning Convex Bodies is Hard (with L. Rademacher) COLT 2009
• Expanders via Random Spanning Trees (with L. Rademacher and S. Vempala) SODA 2009
• The VPN Conjecture is True (with N. Olver and B. Shepherd) STOC 2008

Publications list at DBLP

Interns I have worked with

Nishanth Nair, Karthekeyan Chandrasekaran, Bernhard Haeupler, Neil Olver

Program Committees

FSTTCS 2009

Contact

email: navingo@microsoft.com

phone: +91 080 6658 6113 (office)  +91 963 257 7400 (cell)