My research interests are in the design and analysis of algorithms and data structures. In this overview, I detail my interest in online algorithms. This is the area in which I am currently working, however, I am quite receptive to the idea of collaborating in other areas. An online algorithm is an algorithm which works under the handicap of an uncertain future. The problem to be solved is revealed to the algorithm incrementally, and the algorithm's solution must also be produced incrementally.
Many fundamental problems arising in computer systems are online.
In order to contrast them with online algorithms, algorithms which are not restricted in this way are called offline algorithms. The measure of performance used is the competitive ratio . Two types of results are sought. The goal is to find matching upper and lower bounds for a given problem. Much of my research has focused on the use of randomization by online algorithms.