1. Courtois, P. J.: Decomposability: Queueing and Computer System Applications, Academic Press, New York, 1977.
2. Dayar, T. and Stewart, W.J.: On the effects of using the Grassman-TaksarHeyman method in iterative aggregation-disaggregation, SIAM Journal on Scientific Computing, vol. 17, 1996, pp. 287–303.
3. Dayar, T. and Stewart, W.J.: Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains, to appear in SIAM Journal on Scientific Computing.
4. Gambin, A.: Combinatorial Methods in Approximation Algorithms for Markov Chains with Large State Space. PhD thesis, TR No. 260 Institute of Informatics, Warsaw University 1999.
5. Gambin, A. and Pokarowski, P.: A combinatorial aggregation algorithm for stationary distribution of a large Markov chain, accepted to FCT’2001.