Self-organizing heuristics for implicit data structures
SIAM Journal on Computing
Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
Self-organizing sequential search and Hilbert's inequalities
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Simulations of dynamic sequential search algorithms
Communications of the ACM
On self-organizing sequential search heuristics
Communications of the ACM
Properties of the working-set model
Communications of the ACM
Self-organizing search lists using probabilistic back-pointers
Communications of the ACM
ACM Computing Surveys (CSUR)
Systolic Self-Organizing Lists Under Transpose
IEEE Transactions on Parallel and Distributed Systems
Arithmetic coding for data compression
Communications of the ACM
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Low power address encoding using self-organizing lists
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Efficient power reduction techniques for time multiplexed address buses
Proceedings of the 15th international symposium on System Synthesis
Adaptive Structuring of Binary Search Trees Using Conditional Rotations
IEEE Transactions on Knowledge and Data Engineering
Adaptive low-power address encoding techniques using self-organizing lists
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on low power
An asymptotic optimality of the transposition rule for linear lists
ACM SIGMETRICS Performance Evaluation Review
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Paging and list update under bijective analysis
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
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
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithms and theory of computation handbook
PReMI'11 Proceedings of the 4th international conference on Pattern recognition and machine intelligence
SIAM Journal on Computing
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
List update with probabilistic locality of reference
Information Processing Letters
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Paging and list update under bijective analysis
Journal of the ACM (JACM)
| Hi-index | 0.03 |
Algorithms that modify the order of linear search lists are surveyed. First the problem, including assumptions and restrictions, is defined. Next a summary of analysis techniques and measurements that apply to these algorithms is given. The main portion of the survey presents algorithms in the literature with absolute analyses when available. The following section gives relative measures that are applied between two or more algorithms. The final section presents open questions.