Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
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.
Nelson, Peter R.
1977.
Single-shelf library-type Markov chains with infinitely many books.
Journal of Applied Probability,
Vol. 14,
Issue. 2,
p.
298.
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.
Lam, K.
Siu, M.K.
and
Yu, C.T.
1981.
A generalized counter scheme.
Theoretical Computer Science,
Vol. 16,
Issue. 3,
p.
271.
Dies, Jacques-Edouard
1981.
R�currence positive des librairies mixtes.
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete,
Vol. 58,
Issue. 4,
p.
509.
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.
Dies, Jacques-Edouard
1982.
Hendricks libraries and Tsetlin piles.
Advances in Applied Probability,
Vol. 14,
Issue. 1,
p.
37.
Meketon, Marc S.
and
Topkis, Donald M.
1983.
Adaptive Routing for Damaged Networks.
p.
281.
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.
Oommen, B. John
and
Hansen, E. R.
1986.
ICDT '86.
Vol. 243,
Issue. ,
p.
349.
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.
Oommen, B. John
and
Ng, David T. H.
1989.
Optimal Algorithms.
Vol. 401,
Issue. ,
p.
115.
Oommen, B.John
Hansen, E.R.
and
Munro, J.I.
1990.
Deterministic optimal and expedient move-to-rear list organizing strategies.
Theoretical Computer Science,
Vol. 74,
Issue. 2,
p.
183.
Kowalska, Anna
1992.
A new class of libraries.
Journal of Theoretical Probability,
Vol. 5,
Issue. 3,
p.
431.
Simha, Rahul
and
Majumdar, Amitava
1994.
On lookahead in the list update problem.
Information Processing Letters,
Vol. 50,
Issue. 2,
p.
105.
Oommen, John
and
Dong, Juan
1997.
Algorithms and Computation.
Vol. 1350,
Issue. ,
p.
414.
Albers, Susanne
1998.
A competitive analysis of the list update problem with lookahead.
Theoretical Computer Science,
Vol. 197,
Issue. 1-2,
p.
95.
Albers, Susanne
and
Westbrook, Jeffery
1998.
Online Algorithms.
Vol. 1442,
Issue. ,
p.
13.