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
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
Strongly competitive algorithms for paging with locality of reference
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)
On-line algorithms for cache sharing
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)
Competitive k-server algorithms
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Reducing disk power consumption in a portable computer
ACM SIGOPS Operating Systems Review
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Journal of the ACM (JACM)
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On algorithm design for metrical task systems
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
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On-line search in a simple polygon
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
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line complexity of monotone set systems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The harmonic k-server algorithm is competitive
Journal of the ACM (JACM)
Better algorithms for unfair metrical task systems and applications
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Generalized connection caching
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Mobile facility location (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Online server allocation in a server farm via benefit task systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On page migration and other relaxed task systems
Theoretical Computer Science
Online paging and file caching with expiration times
Theoretical Computer Science
On-line algorithms for the dynamic traveling repair problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A general decomposition theorem for the k-server problem
Information and Computation
On the On-line Number of Snacks Problem
Journal of Global Optimization
On-line k-Truck Problem and Its Competitive Algorithms
Journal of Global Optimization
On list update and work function algorithms
Theoretical Computer Science
The 3-server problem in the plane
Theoretical Computer Science
More on Weighted Servers or FIFO is Better than LRU
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
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
Extending the Accommodating Function
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
New Results on the k-Truck Problem
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th 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
On metric ramsey-type phenomena
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
More on randomized on-line algorithms for caching
Theoretical Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
More on weighted servers or FIFO is better than LRU
Theoretical Computer Science
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
SIGACT news online algorithms column 2
ACM SIGACT News
On-Line Algorithms for the Dynamic Traveling Repair Problem
Journal of Scheduling
Randomized k-server algorithms for growth-rate bounded graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The CNN problem and other k-server variants
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Randomized k-server algorithms for growth-rate bounded graphs
Journal of Algorithms
Statistical buffering for streaming media data access in a mobile environment
Proceedings of the 2006 ACM symposium on Applied computing
Competitive algorithms for maintaining a mobile center
Mobile Networks and Applications
The generalized two-server problem
Journal of the ACM (JACM)
Reconfigurable resource scheduling
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
Theoretical Computer Science
Competitive algorithms for the bicriteria k-server problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
On the remote server problem or more about TCP acknowledgments
Theoretical Computer Science
Competitiveness via primal-dual
ACM SIGACT News
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Online chasing problems for regular polygons
Information Processing Letters
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Reasoning about online algorithms with weighted automata
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Adaptive Physical Design for Curated Archives
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Online Computation with Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A scheme for on-site service provision in pervasive assistive environments
Proceedings of the 2nd International Conference on PErvasive Technologies Related to Assistive Environments
A Comparison of Performance Measures for Online Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Randomized algorithm for the k-server problem on decomposable spaces
Journal of Discrete Algorithms
Reasoning about online algorithms with weighted automata
ACM Transactions on Algorithms (TALG)
A competitive algorithm for the general 2-server problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A competitive online algorithm for the paging problem with "shelf" memory
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the on-line k-taxi problem with limited look ahead
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
A randomized algorithm for two servers in cross polytope spaces
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
Towards the randomized k-server conjecture: a primal-dual approach
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Metrical task systems and the k-server problem on HSTs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A regularization approach to metrical task systems
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
On the additive constant of the k-server Work Function Algorithm
Information Processing Letters
A randomized algorithm for two servers in cross polytope spaces
Theoretical Computer Science
Online computation with advice
Theoretical Computer Science
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Review: Of robot ants and elephants: A computational comparison
Theoretical Computer Science
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online algorithms for the vehicle scheduling problem with time objective
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On the online dial-a-ride problem with time-windows
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the additive constant of the k-server work function algorithm
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Mobile learning support with statistical inference-based cache management
ICWL'07 Proceedings of the 6th international conference on Advances in web based learning
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the on-line k-truck problem with benefit maximization
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Online k-server routing problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Competitive strategy for on-line leasing of depreciable equipment
Mathematical and Computer Modelling: An International Journal
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
The k-resource problem in uniform metric spaces
Theoretical Computer Science
On the on-line weighted k-taxi problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A new approach to solve the k-server problem based on network flows and flow cost reduction
Computers and Operations Research
Hybrid storage management for database systems
Proceedings of the VLDB Endowment
| Hi-index | 0.01 |