Lower bounds for randomized k-server and motion-planning algorithms

Navigating in unfamiliar geometric terrain

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

On-line navigation in a room

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

A polylog(n)-competitive algorithm for metrical task systems

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Can competitive analysis be made competitive?

CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1