B. Clark, G. Reza-Latif-Shabgahi. A bottom-up algorithm for finding minimal cut-sets of fault trees. In M. H. Hamza, editor, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, February 17-19, 2004. pages 514-519, IASTED/ACTA Press, 2004.
@inproceedings{ClarkR04:0,
title = {A bottom-up algorithm for finding minimal cut-sets of fault trees},
author = {B. Clark and G. Reza-Latif-Shabgahi},
year = {2004},
researchr = {https://researchr.org/publication/ClarkR04%3A0},
cites = {0},
citedby = {0},
pages = {514-519},
booktitle = {Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, February 17-19, 2004},
editor = {M. H. Hamza},
publisher = {IASTED/ACTA Press},
}