Comparison of self-organizing linear search rules

DOI10.2307/3213694MaRDI QIDQ3340212zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3213694

zbMATH Keywords

monotone Markov chainmove-forward rulesearch costtransposition rule

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Recommendations

• Self-organizing files with dependent accesses
• scientific article; zbMATH DE number 903457
• MOVE-TO-FRONT RULE FOR ACCESSING SEVERAL RECORDS
• Cost comparison of a spectrum of self-organizing rules
• scientific article; zbMATH DE number 3856448

Cited in

(10)

• Self-organizing sequential search and Hilbert's inequalities
• scientific article; zbMATH DE number 3888923 (Why is no real title available?)
• Self-organizing files with dependent accesses
• scientific article; zbMATH DE number 3856448 (Why is no real title available?)
• MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM
• Applying POS(i) rules to communication problems
• A generalized abel's partial summation formula and its application in self-organizing systems
• Cost comparison of a spectrum of self-organizing rules
• The move-to-partner rule for self-organizing task allocation on a linear array
• Stochastic rearrangement rules for self-organizing data structures

This page was built for publication: Comparison of self-organizing linear search rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340212)