Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Hendricks, W. J.
1973.
An extension of a theorem concerning an interesting Markov chain.
Journal of Applied Probability,
Vol. 10,
Issue. 4,
p.
886.
Hendricks, W. J.
1973.
An extension of a theorem concerning an interesting Markov chain.
Journal of Applied Probability,
Vol. 10,
Issue. 4,
p.
886.
Kingman, J. F. C.
1975.
Random Discrete Distributions.
Journal of the Royal Statistical Society Series B: Statistical Methodology,
Vol. 37,
Issue. 1,
p.
1.
Cohen, J. W.
and
Van Marion, E. W. B.
1976.
Analysis of storage hierarchy.
Journal of Engineering Mathematics,
Vol. 10,
Issue. 3,
p.
263.
Hendricks, W. J.
1976.
An Account of Self-Organizing Systems.
SIAM Journal on Computing,
Vol. 5,
Issue. 4,
p.
715.
Rivest, Ronald
1976.
On self-organizing sequential search heuristics.
Communications of the ACM,
Vol. 19,
Issue. 2,
p.
63.
Rao, Gururaj S.
1978.
Performance Analysis of Cache Memories.
Journal of the ACM,
Vol. 25,
Issue. 3,
p.
378.
Bitner, James R.
1979.
Heuristics That Dynamically Organize Data Structures.
SIAM Journal on Computing,
Vol. 8,
Issue. 1,
p.
82.
Phelps, R.I.
and
Thomas, L.C.
1980.
On Optimal Performance in Self-Organizing Paging Algorithams.
Journal of Information and Optimization Sciences,
Vol. 1,
Issue. 1,
p.
80.
Matthews, D.
Rotem, D.
and
Bretholz, E.
1980.
Self-organizing doubly linked lists†.
International Journal of Computer Mathematics,
Vol. 8,
Issue. 2,
p.
99.
Lam, K.
Siu, M.K.
and
Yu, C.T.
1981.
A generalized counter scheme.
Theoretical Computer Science,
Vol. 16,
Issue. 3,
p.
271.
Tenenbaum, Aaron M.
and
Nemes, Richard M.
1982.
Two Spectra of Self-Organizing Sequential Search Algorithms.
SIAM Journal on Computing,
Vol. 11,
Issue. 3,
p.
557.
Meketon, Marc S.
and
Topkis, Donald M.
1983.
Adaptive Routing for Damaged Networks.
p.
281.
Lam, Kin
Leung, Ming-Ying
and
Siu, Man-Keung
1984.
Self-organizing files with dependent accesses.
Journal of Applied Probability,
Vol. 21,
Issue. 2,
p.
343.
Bentley, Jon L.
and
McGeoch, Catherine C.
1985.
Amortized analyses of self-organizing sequential search heuristics.
Communications of the ACM,
Vol. 28,
Issue. 4,
p.
404.
Topkis, Donald M.
1986.
Reordering heuristics for routing in communications networks.
Journal of Applied Probability,
Vol. 23,
Issue. 1,
p.
130.
Oommen, B. John
and
Hansen, E. R.
1986.
ICDT '86.
Vol. 243,
Issue. ,
p.
349.
Treisman, Michel
and
Doctor, Estelle
1987.
Memory scanning: A comparison of the dynamic stack and exhaustive serial scan models, with an extension of the latter.
Acta Psychologica,
Vol. 64,
Issue. 1,
p.
39.
Oommen, B. John
and
Hansen, E. R.
1987.
List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations.
SIAM Journal on Computing,
Vol. 16,
Issue. 4,
p.
705.
Chung, F.R.K.
Hajela, D.J.
and
Seymour, P.D.
1988.
Self-organizing sequential search and Hilbert's inequalities.
Journal of Computer and System Sciences,
Vol. 36,
Issue. 2,
p.
148.