The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  1. Allen, Brian; Munro, Ian. Self-organizing binary search trees. J. Assoc. Comput. Mach. 25 (1978), no. 4, 526--535. MR0508699 (80a:68034)
  2. Bidigare, Pat; Hanlon, Phil; Rockmore, Dan. A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements. Duke Math. J. 99 (1999), no. 1, 135--174. MR1700744 (2000m:52032)
  3. Bjorner,A. Random walks, arrangements, cell complexes, greedoids, and self-organizing libraries, in ``Building Bridges'' (eds. M. Grotschel and G. O. H. Katona), Bolyai Soc. Math. Studies 19 (2008), Springer (Berlin) and Janos Bolyai Math. Soc. (Budapest), pp.165--203.
  4. Brown, Kenneth S. Semigroups, rings, and Markov chains. J. Theoret. Probab. 13 (2000), no. 3, 871--938. MR1785534 (2001e:60141)
  5. Brown, Kenneth S.; Diaconis, Persi. Random walks and hyperplane arrangements. Ann. Probab. 26 (1998), no. 4, 1813--1854. MR1675083 (2000k:60138)
  6. Dobrow, Robert P.; Fill, James Allen. On the Markov chain for the move-to-root rule for binary search trees. Ann. Appl. Probab. 5 (1995), no. 1, 1--19. MR1325037 (96d:60100)
  7. Fill, James Allen; Holst, Lars. On the distribution of search cost for the move-to-front rule. Random Structures Algorithms 8 (1996), no. 3, 179--186. MR1603279 (99b:60118)
  8. Stanley, Richard P. Enumerative combinatorics. Vol. 1.With a foreword by Gian-Carlo Rota.Corrected reprint of the 1986 original.Cambridge Studies in Advanced Mathematics, 49. Cambridge University Press, Cambridge, 1997. xii+325 pp. ISBN: 0-521-55309-1; 0-521-66351-2 MR1442260 (98a:05001)


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.