1. P. Bratley, B. L. Fox, and L.E. Schrage, A Guide to Simulation (2nd ed.), Springer-Verlag, 1987.
2. B.L. Fox, Generating Markov-chain transitions quickly: I, Operations Research Society of America Journal on Computing
2 (1990), pp. 126–135.
3. L. Kleinrock, Queueing Systems. Vol. 1: Theory, John Wiley & Sons, 1975.
4. Y. Matias, J. S. Vitter, and W. C. Ni, Dynamic generation of discrete random variates, In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (1993), pp. 361–370.
5. M.H. Overmars and J. van Leeuwen, Worst-case optimal insertion and deletion methods for decomposable searching problems, Information Processing Letters 12 (1981), pp. 168–173.