An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Online algorithms for locating checkpoints
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Random walks on weighted graphs, and applications to on-line algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The harmonic online K-server algorithm is competitive
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Infinite games: randomization, computability, and applications to online problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Randomized competitive algorithms for the list update problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Generosity helps, or an 11–competitive algorithm for three servers
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Competitive k-server algorithms
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Spreading rumors rapidly despite an adversary
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Competitive solutions for online financial problems
ACM Computing Surveys (CSUR)
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On page migration and other relaxed task systems
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Design of on-line algorithms using hitting times
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for dynamic storage allocation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Generating adversaries for request-answer games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new lower bound for the list update problem in the partial cost model
Theoretical Computer Science
Distributed caching independent of the network size
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the On-line Number of Snacks Problem
Journal of Global Optimization
A Variant of the Arrow Distributed Directory with Low Average Complexity
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Optimal Projective Algorithms for the List Update Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Carrying Umbrellas: An Online Relocation Problem on Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
New Results on the k-Truck Problem
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
New results for online page replication
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Randomized Lower Bounds for Online Path Coloring
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Competitive distributed file allocation
Information and Computation
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Fighting against two adversaries: page migration in dynamic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Competitive algorithms for the dynamic selection of component implementations
IBM Systems Journal
New results for online page replication
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Dynamic page migration with stochastic requests
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Competitive Analysis for the On-line Truck Transportation Problem
Journal of Global Optimization
Online pricing for web service providers
Proceedings of the 2006 international workshop on Economics driven software engineering research
Randomized Algorithms for Buffer Management with 2-Bounded Delay
Approximation and Online Algorithms
On the on-line k-taxi problem with limited look ahead
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Reinforcement learning with time
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
One to rule them all: a general randomized algorithm for buffer management with bounded delay
ESA'11 Proceedings of the 19th European conference on Algorithms
Bucket game with applications to set multicover and dynamic page migration
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Improved algorithms for dynamic page migration
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Computer Science Review
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |