Amortized efficiency of list update and paging rules
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Empirical model-building and response surface
Empirical model-building and response surface
The input/output complexity of sorting and related problems
Communications of the ACM
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal constructions of hybrid algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Bounding the diffuse adversary
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line paging against adversarially biased random inputs
Journal of Algorithms
The working set model for program behavior
Communications of the ACM
The ultimate strategy to search on m rays?
Theoretical Computer Science
The Polygon Exploration Problem
SIAM Journal on Computing
The Accommodating Function: A Generalization of the Competitive Ratio
SIAM Journal on Computing
SIAM Journal on Computing
SIAM Journal on Computing
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Online Parallel Heuristics and Robot Searching under the Competitive Framework
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Competitive Searching in Polygons - Beyond Generalised Streets
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Competitive Analysis of Paging
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
On-line target searching in bounded and unbounded domains
On-line target searching in bounded and unbounded domains
Theoretical Computer Science
On paging with locality of reference
Journal of Computer and System Sciences
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM - Designing for the mobile device
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Software Engineering
On List Update with Locality of Reference
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Paging and list update under bijective analysis
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Cache-oblivious range reporting with optimal queries requires superlinear space
Proceedings of the twenty-fifth annual symposium on Computational geometry
The relative worst order ratio for on-line algorithms
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
As computer science has progressed, numerous models and measures have been developed over the years. Among the most commonly used in theoretical computer science are the RAM model, the I/O model, worst case analysis, space (memory) usage, average case analysis, amortized analysis, adaptive analysis and the competitive ratio. New models are added to this list every few years to re ect varying constraints imposed by novel application or advances in computer architectures. Examples of alternative models are the transdichotomous RAM or word-RAM, the data stream model, the MapReduce model, the cache oblivious model and the smoothed analysis model. New models and measures, when successful expand our understanding of computation and open new avenues of inquiry. As it is to be expected relatively few models and paradigms are introduced every year, and even less are eventually proven successful. In this paper we discuss rst certain shortcomings of the online competitive analysis model particularly as it concerns paging, discuss existing solutions in the literature as well as present recent progress in developing models and measures that better re ect actual practice for the case of paging. From there we proceed to a more general discussion on how to measure and evaluate new models within theoretical computer science and how to contrast them, when appropriate, to existing models. Lastly, we highlight certain \natural" choices and assumptions of the standard worst-case model which are often unstated and rarely explicitly justied. We contrast these choices to those made in the formalization of probability theory.