I am an Assistant Professor in the
College of Information & Computer Science at the University of Massachusetts Amherst. I am also a Permanent Member of
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers.
Before joining UMass in 2014, I was a Research Scientist at
AT&T Shannon Laboratories, New Jersey. I spent four wonderful years (20072011) at the University of Maryland College Park from where I received my Ph.D. in Computer Science.
Currently, I am spending a semester at the University of California Berkeley as a Visiting Scholar and as a fellow of the Simons Institute. My research interests span
Contact: Email. [my first name]@cs.umass.edu, firstname.cs@gmail.com 
Recent Awards.
Program Committee Member.

Recent Invited Talks/Visits
Outreach Activities

New Constructive Aspects of the Lovasz Local Lemma,
with Bernhard Haeupler and Aravind Srinivasan.
IEEE Symposium on Foundations of Computer Science (FOCS) 2010. Journal version in JACM 2011.
This paper settles an outstanding open question related to fair allocation of resources, known as the Santa Claus problem. More
generally, it extends the scope of algorithmic Local Lemma to handle much broader set of application that were not within the reach
of prior methods.
A Unified Approach to Ranking in Probabilistic Databases,
with Jian Li and Amol Deshpande.
35th International Conference on Very Large Data Bases (VLDB), 2009. BEST PAPER AWARD. Journal version in VLDB Journal 2011.
This paper provides a general framework for ranking based on probabilitygenerating functions that captures most prior definitions
of ranking. Prior to our work, there were many proposals for ranking when data is uncertain with widely different behaviors.