Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Diaconis, Persi
Fill, James Allen
and
Pitman, Jim
1992.
Analysis of Top To Random Shuffles.
Combinatorics, Probability and Computing,
Vol. 1,
Issue. 2,
p.
135.
Phatarfod, R. M.
1994.
On the transition probabilities of the move-to-front scheme.
Journal of Applied Probability,
Vol. 31,
Issue. 2,
p.
570.
1996.
The move-to-root rule for self-organizing trees with Markov dependent requests∗.
Stochastic Analysis and Applications,
Vol. 14,
Issue. 1,
p.
73.
Fill, James Allen
1996.
An exact formula for the move-to-front rule for self-organizing lists.
Journal of Theoretical Probability,
Vol. 9,
Issue. 1,
p.
113.
Phatarfod, R. M.
Pryde, A. J.
and
Dyte, David
1997.
On the move-to-front scheme with Markov dependent requests.
Journal of Applied Probability,
Vol. 34,
Issue. 03,
p.
790.
Phatarfod, R. M.
and
Pryde, A. J.
1998.
On some multi-request move-to-front heuristics.
Journal of Applied Probability,
Vol. 35,
Issue. 4,
p.
911.
Brown, Kenneth S.
and
Diaconis, Persi
1998.
Random walks and hyperplane arrangements.
The Annals of Probability,
Vol. 26,
Issue. 4,
Bidigare, Pat
Hanlon, Phil
and
Rockmore, Dan
1999.
A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements.
Duke Mathematical Journal,
Vol. 99,
Issue. 1,
Jelenković, Predrag R.
1999.
Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities.
The Annals of Applied Probability,
Vol. 9,
Issue. 2,
Pryde, A.J.
and
Phatarfod, R.M.
1999.
Multiplicities of eigenvalues of some linear search schemes.
Linear Algebra and its Applications,
Vol. 291,
Issue. 1-3,
p.
115.
Bapat, R.B.
2003.
Perron eigenvector of the Tsetlin matrix.
Linear Algebra and its Applications,
Vol. 363,
Issue. ,
p.
3.
Garsia, A.M.
and
Wallach, N.
2003.
Qsym over Sym is free.
Journal of Combinatorial Theory, Series A,
Vol. 104,
Issue. 2,
p.
217.
Reiner, Victor
and
Webb, Peter
2004.
The combinatorics of the bar resolution in group cohomology.
Journal of Pure and Applied Algebra,
Vol. 190,
Issue. 1-3,
p.
291.
Lusztig, G.
2006.
Studies in Lie Theory.
Vol. 243,
Issue. ,
p.
405.
Garsia, A.M.
and
Wallach, N.
2007.
r-Qsym is free over Sym.
Journal of Combinatorial Theory, Series A,
Vol. 114,
Issue. 4,
p.
704.
Pryde, A.J.
2009.
Comparison of subdominant eigenvalues of some linear search schemes.
Linear Algebra and its Applications,
Vol. 431,
Issue. 9,
p.
1439.
Vojnovic, M.
Cruise, J.
Gunawardena, D.
and
Marbach, P.
2009.
Ranking and Suggesting Popular Items.
IEEE Transactions on Knowledge and Data Engineering,
Vol. 21,
Issue. 8,
p.
1133.
Athanasiadis, Christos A.
and
Diaconis, Persi
2010.
Functions of random walks on hyperplane arrangements.
Advances in Applied Mathematics,
Vol. 45,
Issue. 3,
p.
410.
Chung, Fan
and
Graham, Ron
2012.
Edge flipping in graphs.
Advances in Applied Mathematics,
Vol. 48,
Issue. 1,
p.
37.
Ayyer, Arvind
Klee, Steven
and
Schilling, Anne
2014.
Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics.
Vol. 71,
Issue. ,
p.
285.