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
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth 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
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
Online algorithms for locating checkpoints
STOC '90 Proceedings of the twenty-second 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
On a random walk problem arising in self-stabilizing token management
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed 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
Generosity helps, or an 11–competitive algorithm for three servers
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 k-server algorithms
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
On Randomization In Online Computation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Asynchronous rendezvous of anonymous agents in arbitrary graphs
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |