Career
He is known for his work competitive analysis of online algorithms, particularly for the k-server problem. His contributions, with his co-author Lawrence L. Larmore, led to the application of T-theory to the server problem. He obtained his Doctor of Philosophy in Computer Science from Warsaw University in 1985.
