1. Yashkov, S.F., Analiz ocheredei v EVM (Analysis of Queues in Computers), Moscow: Radio i Svyaz’, 1989.
2. Yashkov, S.F. and Yashkova, A.S., Processor Sharing: A Survey of the Mathematical Theory, Autom. Remote Control, 2007, vol. 68, no. 9, pp. 1662–1731.
3. Yashkov, S.F. and Yashkova, A.S., Some Insight to the Time-Dependent Properties of the Queue Length Process in the M/G/1-EPS and LCFS-P Queues, Information Processes, 2005, vol. 5, no. 2, pp. 102–105 (available at http://www.jip.ru/ ).
4. Abate, J., Choudhuri, G.L., and Whitt, W., Calculating the M/G/1 Busy-Period Density and LIFO Waiting-Time Distribution by Direct Numerical Transform Inversion, Oper. Res. Lett., 1995, vol. 18, pp. 113–119.
5. Asmussen, S. and Teugels, J.L., Convergence Rates for M/G/1 Queues and Ruin Problems with Heavy Tails, Adv. Appl. Probab. (to be published).