Amortized analyses of self-organizing sequential search heuristics
- 1 April 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 28 (4), 404-411
- https://doi.org/10.1145/3341.3349
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Self-adjusting binary treesPublished by Association for Computing Machinery (ACM) ,1983
- Two Spectra of Self-Organizing Sequential Search AlgorithmsSIAM Journal on Computing, 1982
- Simulations of dynamic sequential search algorithmsCommunications of the ACM, 1978
- An Account of Self-Organizing SystemsSIAM Journal on Computing, 1976
- On self-organizing sequential search heuristicsCommunications of the ACM, 1976
- An extension of a theorem concerning an interesting Markov chainJournal of Applied Probability, 1973
- On a model for storage and searchJournal of Applied Probability, 1973
- Optimal Policy in a Dynamic, Single Product, Nonstationary Inventory Model with Several Demand ClassesOperations Research, 1965
- On Serial Files with Relocatable RecordsOperations Research, 1965