1. Agrawal, P., Breuer, M. A.: A probabilistic model for the analysis of the routing process for circuits. Networks10, 111–128 (1980).
2. Angluin, D., Valiant, L. G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Compt. Syst. Sci.19, 155–193 (1979).
3. Apers, P. M. G.: The expected number of phases of the Dinic-Karzanov network flow algorithm. Informatica Rapport IR 27. Amsterdam: Vrije Universiteit 1978.
4. d'Atri, G.: Outline of a probabilistic framework for combinatorial optimization. In: Numerical techniques for stochastic systems (Archetti, F., Cugiani, M., eds.), pp. 347–368. North-Holland 1980.
5. d'Atri, G., Puech, C.: Probabilistic analysis of the subset-sum problem. Report No. 1. Universita della Calabria, 1980.