Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Competitive algorithms for server problems
Journal of Algorithms
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
The harmonic online K-server algorithm is competitive
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of Algorithms
A competitive 3-server algorithm
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New results on server problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Journal of the ACM (JACM)
A probabilistic approach to the problem of automatic selection of data representations
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Design of on-line algorithms using hitting times
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The lazy adversary conjecture fails
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
More on random walks, electrical networks, and the harmonic k-server algorithm
Information Processing Letters
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Analysis of the Harmonic Algorithm for Three Servers
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
SIGACT news online algorithms column 2
ACM SIGACT News
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Efficiency test of pseudorandom number generators using random walks
Journal of Computational and Applied Mathematics
New theoretical results on quadratic placement
Integration, the VLSI Journal
Note: Random walks and the effective resistance sum rules
Discrete Applied Mathematics
Learning recommendations in social media systems by weighting multiple relations
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
Strategy-proof mechanisms for facility location games with many facilities
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Multi-robot adversarial patrolling: facing a full-knowledge opponent
Journal of Artificial Intelligence Research
Computer Science Review
| Hi-index | 0.01 |