
I am a Ph.D. candidate at Northwestern University in Computer Science.
I graduated from University of Illinois, UrbanaChampaign in 2003 with a B.S. in Math and B.S. in Civil Engineering.
Research: 
I am interested in expert learning, in particular from a game theory perspective. My advisor is Jason Hartline. I also work in DNA computation and financial market design. 
Papers: 
ISAAC 2013, Hong Kong; Computing Minimum Tile Sets to SelfAssemble Colors Patterns.
Patterned selfassembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely selfassemble a given rectangular color pattern. For k>=1, kPATS is a variant of PATS that restricts input patterns to those with at most k colors. We prove the NPhardness of 29PATS, where the best known is that of 60PATS. 


