1. Technical report IMAG-Grenoble, France RR Mai-25;O Abu-amsha,1996
2. T. Dayar and N. Pekergin, Stochastic comparison, reorderings, and nearly completely decomposable Markov chains, in the Proceedings of the International Conference on the Numerical Solution of Markov Chains (NSMC’99),pp. 228–246, (Ed. B. Plateau, W. Stewart), Prensas universitarias de Zaragoza, (1999).
3. J. Keilson, A. Kester, Monotone Matrices and Monotone Markov Processes, Stochastic Processes and their Applications, vol.5, pp. 231–241, (1977).
4. J. Lui, R. Muntz, D. Towsley, Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach, IEEE Trans. on Compt, vol. 44, no. 12, (Dec. 1995).
5. J. Lui, R. Muntz, D. Towsley, Computing performance bounds of Fork-Join parallel programs under a multiprocessing environment, IEEE Trans. Paral. and Dist. Comp, vol. 9, no.3, (march 1998). vol. 44, no. 12, (Dec. 1995).