Self-organizing lists and independent references: a statistical synergy
Citations
106 citations
22 citations
Cites background from "Self-organizing lists and independe..."
...Good estimates, especially for the smaller probabilities, require an inordinately long sampling time, typically much longer than E[TCp)] Csee [21])....
[...]
13 citations
11 citations
Cites background or methods from "Self-organizing lists and independe..."
...The Counter Scheme (CS), which maintains a reference count for each element, and rearranges the list in decreasing order of the counters, can be shown to converge to the optimal ordering [7]....
[...]
...Hofri and Shachnai present in [7] a stopping point for this reorganization process in the case in which the vector of access probabilities p̄ = (p1, ....
[...]
...In [7] it is shown using the additivity of expectation that Cm(CS|p̄) = C(OPT | p̄) + ∑...
[...]
..., [8, 7]), in which a set of n items held as a linear list is accessed randomly, according to some fixed probability distribution....
[...]
8 citations
References
2,378 citations
"Self-organizing lists and independe..." refers background in this paper
...Recently, there have appeared some work [Sleator and Tarjan (1985), Bentley and McGeogh (1985)] that considers not the expected cost of MTF, but rather the highest possible cost (worst case), when averaged (or – as called in that context – amortized) over a long reference sequence....
[...]
357 citations
"Self-organizing lists and independe..." refers background in this paper
...We conclude with a discussion of the assumptions of the model and point out that there are many questions concerning it, and its immediate extensions, that are as yet unanswered....
[...]
...There is a substantial statistical literature on discriminating multinomial probabilities, under various requirements; a comprehensive account is Gibbons et al. (1977)....
[...]
...…the other hand, when pi − p j > 0 is very small, even though the number of references required to order them correctly with high probability is huge [Gibbons et al. (1977)], the corresponding penalty of incorrect order is minute (even when pi and p j proper are not small – since the added cost is…...
[...]
244 citations
"Self-organizing lists and independe..." refers background or methods in this paper
...We conclude with a discussion of the assumptions of the model and point out that there are many questions concerning it, and its immediate extensions, that are as yet unanswered....
[...]
...This rule was found to be more efficient asymptotically than the MTF scheme [Hendricks, (1976), Rivest (1976)]....
[...]
...Its asymptotic cost per access under various rpv’s has been discussed by Bitner (1979), Burville and Kingman (1973), Hendricks (1976), Knuth (1973), McCabe (1965) and Rivest (1976)....
[...]
...This holds true independently of the list order and the history of past accesses....
[...]
159 citations
"Self-organizing lists and independe..." refers background in this paper
...Its asymptotic cost per access under various rpv’s has been discussed by Bitner (1979), Burville and Kingman (1973), Hendricks (1976), Knuth (1973), McCabe (1965) and Rivest (1976)....
[...]
...This holds true independently of the list order and the history of past accesses....
[...]
148 citations