ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
More on randomized on-line algorithms for caching
Theoretical Computer Science
Journal of Scheduling
Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Dynamic page migration with stochastic requests
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
SIGACT news online algorithms column 8
ACM SIGACT News
Scheduling search procedures: The wheel of fortune
Journal of Scheduling
Models and Algorithms for Stochastic Online Scheduling
Mathematics of Operations Research
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
Paging and list update under bijective analysis
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
On the relative dominance of paging algorithms
Theoretical Computer Science
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
Compositional competitiveness for distributed algorithms
Journal of Algorithms
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
ESA'07 Proceedings of the 15th annual European conference on Algorithms
On the relative dominance of paging algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
SIGACT news online algorithms column 17
ACM SIGACT News
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online routing in faulty meshes with sub-linear comparative time and traffic ratio
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A cost mechanism for fair pricing of resource usage
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Stochastic online scheduling on parallel machines
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online multi-path routing in a maze
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
List update with probabilistic locality of reference
Information Processing Letters
An online algorithm optimally self-tuning to congestion for power management problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Computer Science Review
Engineering efficient paging algorithms
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Is Tail-Optimal Scheduling Possible?
Operations Research
Paging and list update under bijective analysis
Journal of the ACM (JACM)
How much is it worth to know the future in online conversion problems?
Discrete Applied Mathematics
Relative interval analysis of paging algorithms on access graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
| Hi-index | 0.01 |
The competitive analysis of online algorithms has been criticized as being too crude and unrealistic. We propose refinements of competitive analysis in two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for online decision-making. We illustrate the first with an application to the paging problem; as a byproduct we characterize completely the work functions of this important special case of the k-server problem. We use the second refinement to explore the power of lookahead in server and task systems.