Aleck Johnsen
Office: Ford 3-227, 2145 Sheridan Rd, Evanston, IL, 60208

I am a Ph.D. candidate at Northwestern University in Computer Science. I graduated from University of Illinois, Urbana-Champaign 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 Self-Assemble Colors Patterns. Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular color pattern. For k>=1, k-PATS is a variant of PATS that restricts input patterns to those with at most k colors. We prove the NP-hardness of 29-PATS, where the best known is that of 60-PATS.

Fall 2014, EECS 214 (also listed as 395/495) Data Structures and Data Management
Course Policies and Syllabus
Installing Python 2.7.8

TA Exp.:         Spring 2014, EECS 2014 Data Structures for Amartya Banerjee; Winter 2013 and Winter 2012, EECS 336 Intro Algorithms for Ming-Yang Kao