Kevin has worked on two major research projects. The first involves understanding the impact of caches on the performance of algorithms. Kevin developed a variant of the FFT that yields optimal use of hardware prefetching, which resulted in a workshop paper given by Kevin and a paper describing a mathematical model of prefetching. The second project concerns DNF minimization, which is perhaps the most natural and important example of a problem that is "even harder" than NP. Kevin contributed key insights that lead to tight bounds on the approximability of a class of DNF minimization problems.

In addition to working on his research projects, Kevin has maintained a high GPA in a demanding course schedule and has served as a teaching assistant.