1. and , An O(|E|) time algorithm for computing the reliability of a class of directed networks. Technical report 82-7, Operations Research Center, University of California, Berkeley 94720 (1982), 28 pp.
2. Complexity of network reliability computations
3. Transportation networks with random arc capacities
4. Combinatorial properties for directed network reliability with a path length criterion. Technical report 82-14, College of Business Administration, University of Illinois, Chicago (1983), 26 pp.
5. Using the decomposition tree for directed network reliability computations. Technical report 83-03. Department of Quantitative Methods, University of Illinois, Chicago (1983), 22 pp.