Randomized online scheduling on two uniform machines
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A general decomposition theorem for the k-server problem
Information and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A General Decomposition Theorem for the k-Server Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
SIGACT news online algorithms column 2
ACM SIGACT News
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms
Randomized priority algorithms
Theoretical Computer Science
A randomized algorithm for two servers in cross polytope spaces
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
A randomized algorithm for two servers in cross polytope spaces
Theoretical Computer Science
| Hi-index | 0.89 |