Hi. I am a second year master's student in Computer Science at Princeton University. I am interested in Theoretical Computer Science. I am fortunate to be advised by Moses Charikar.
Previously, I was an undergraduate student at the Indian Institute of Technology, Kanpur.
My CV is available here.
Research
I am broadly interested in Algorithms and Complexity. My current research focusses on online algorithms for bipartite matching and budgeted allocation under distributional models.
I am also interested in approximation algorithms for combinatorial optimization, especially problems involving submodular functions, and submodularity in general.
Publications
- Contact Center Scheduling with Strict Resource Requirements
(with Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy)
[pdf] in Integer Programming and Combinatorial Optimization (IPCO) 2011
- Random Projection Trees Revisited
(with Purushottam Kar)
[pdf] [arXiv] in Neural Information Processing Systems (NIPS) 2010
- Predicting the Importance of Newsfeed Posts and Social Network Friends
(with Tim Paek, Michael Gamon, Scott Counts, David Maxwell Chickering)
[pdf] in AAAI Conference on Artificial Intelligence (AAAI) 2010
Teaching
I can be reached at adhesi at cs dot princeton dot edu