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
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
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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)
Random walks on weighted graphs and applications to on-line algorithms
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
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomness in private computations
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Amortizing randomness in private multiparty computations
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Distributed paging for general networks
Proceedings of the seventh annual ACM-SIAM symposium on Discrete 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
Competitive randomized algorithms for non-uniform problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Replacement algorithms for object caching
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
The harmonic k-server algorithm is competitive
Journal of the ACM (JACM)
Connection caching under various models of communication
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Generalized connection caching
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
On Optimal Replacement of Nonuniform Cache Objects
IEEE Transactions on Computers
Theoretical Computer Science
More on random walks, electrical networks, and the harmonic k-server algorithm
Information Processing Letters
Carrying Umbrellas: An Online Relocation Problem on Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
A Randomnesss-Rounds Tradeoff in Private Computation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On Randomization In Online Computation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Connection caching: model and algorithms
Journal of Computer and System Sciences
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Conflict-free coloring for intervals: from offline to online
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Computer Science Review
A k-server problem with parallel requests and unit distances
Information Processing Letters
| Hi-index | 0.00 |