- Average Case Analysis of Algorithms on Sequences, 2001, 520
- V.B. Tadic, S.P. Meyn, 5, Proceedings of the 2003 American Control Conference, 2003., 2003, 4426
- Vincent Dumas, Philippe Robert, “On the Throughput of a Resource Sharing Model”, Mathematics of OR, 26, № 1, 2001, 163
- Geoffrey Orsak, 19990749, The Mobile Communications Handbook, Second Edition, 1999
- Chew Soo Hong, Naoko Nishimura, “Revenue non-equivalence between the English and the second-price auctions: experimental evidence”, Journal of Economic Behavior & Organization, 51, № 4, 2003, 443
- I. M. Sonin, “An Arbitrary Nonhomogeneous Markov Chain with Bounded Number of States May Be Decomposed into Asymptotically Noncommunicating Components Having the Mixing Property”, Theory Probab. Appl., 36, № 1, 1992, 74
- Goran Peškir, “The the uniform mean-square ergodic theorem for wide sense stationary processes”, Stochastic Analysis and Applications, 16, № 4, 1998, 697
- Roland Speicher, “Multiplicative functions on the lattice of non-crossing partitions and free convolution”, Math. Ann., 298, № 1, 1994, 611
- Li Xie, V.A. Ugrinovskii, I.R. Petersen, “Probabilistic distances between finite-state finite-alphabet hidden Markov models”, IEEE Trans. Automat. Contr., 50, № 4, 2005, 505
- R. Gouet, F. Plo, M. San Miguel, B. Ycart, 674, Advances in Petri Nets 1993, 1993, 267