My research interests primarily lie in algorithm design and analysis, focusing on parallel algorithms, scheduling, and memory-efficient or large-data algorithms. I am also interested in classic (sequential) algorithms and data structures.
I am looking for strong students with an interest in algorithms. Whereas my interests focus on the theory side, I am also open to motivated systems students in the areas of parallel computing or memory-efficient algorithms.
Before starting at Georgetown in 2011, I was a Computing Innovation Postdoctoral Fellow at Carnegie Mellon University, working with Guy Blelloch. I received my Ph.D. from the Massachusetts Institute of Technology, where Charles Leiserson acted as my advisor. I received my A.B. from Dartmouth College.