My research interests are in algorithm design and analysis. I specialize in the area of online algorithms. In an online problem, input is given incrementally and the algorithm must make decisions about the output with only partial knowledge of the problem. Online problems arise in a wide variety of applications including scheduling, robot motion planning and computational finance. My research focuses on online algorithms for resource allocation as applied to computer systems and operations research. Typically I use formal analysis to evaluate and compare algorithms, although I have been involved in a number of empirical studies as well. Recently I have been working with members of our Embedded Systems Group on online algorithms for power savings. Other projects have included the design and analysis of algorithms for web caching.