The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Some Distribution-Free Aspects of Paging Algorithm Performance
Journal of the ACM (JACM)
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
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Self-organizing sequential search and Hilbert's inequalities
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Deterministic Learning Automata Solutions to the Equipartitioning Problem
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
Improvements to an Algorithm for Equipartitioning
IEEE Transactions on Computers
Randomized competitive algorithms for the list update problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Optimization of a hierarchical file organization for spelling correction
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
Simulations of dynamic sequential search algorithms
Communications of the ACM
Performance analysis of three related assignment problems
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Adaptive Structuring of Binary Search Trees Using Conditional Rotations
IEEE Transactions on Knowledge and Data Engineering
File Allocation in Distributed Databases with Interaction between Files
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
On the Competitiveness of Linear Search
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
DCC '00 Proceedings of the Conference on Data Compression
On the effectiveness of buffered and multiple arm disks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Amortized efficiency of list update rules
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Applying genetic algorithms in database partitioning
Proceedings of the 2003 ACM symposium on Applied computing
MOVE-TO-FRONT RULE FOR ACCESSING SEVERAL RECORDS
Probability in the Engineering and Informational Sciences
Managing routing tables for URL routers in content distribution networks
International Journal of Network Management
Modeling correlations in web traces and implications for designing replacement policies
Computer Networks: The International Journal of Computer and Telecommunications Networking
An asymptotic optimality of the transposition rule for linear lists
ACM SIGMETRICS Performance Evaluation Review
Least-recently-used caching with dependent requests
Theoretical Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Move-Forward Rules And f-SWap Rules Applied To A Communication Problem
Probability in the Engineering and Informational Sciences
Dynamic rule-ordering optimization for high-speed firewall filtering
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Fair service for mice in the presence of elephants
Information Processing Letters
Distributed top-N query processing with possibly uncooperative local systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Data organization in magnetic bubble lattice files
IBM Journal of Research and Development
Statistics & clustering based framework for efficient XACML policy evaluation
POLICY'09 Proceedings of the 10th IEEE international conference on Policies for distributed systems and networks
SIAM Journal on Computing
Lists on lists: a framework for self-organizing lists in environments with locality of reference
WEA'06 Proceedings of the 5th international conference on Experimental 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 | 48.26 |
This paper examines a class of heuristics for maintaining a sequential list in approximately optimal order with respect to the average time required to search for a specified element, assuming that each element is searched for with a fixed probability independent of previous searches performed. The “move to front” and “transposition” heuristics are shown to be optimal to within a constant factor, and the transposition rule is shown to be the more efficient of the two. Empirical evidence suggests that transposition is in fact optimal for any distribution of search probabilities.