I am interested in the general area of algorithm design for combinatorial optimization problems. My focus is on designing solutions that can leverage learnings from data in a principled way that can provide measurable and concrete guarantees.
Prior to joining Meta, I spent several years working on approximation algorithms and online algorithms at the University of Maryland (where I got my PhD), and at the Stanford University (where I spent my postdoc).
Interests
Combinatorial optimization, online algorithms, graph algorithms, algorithmic game theory