Daryl D. Harms

Bounding all-terminal reliability in computer networks

Charles J. Colbourn, Daryl D. Harms, C. Colbourn, 1988, Networks.

Renormalization of two - terminal reliability

Charles J. Colbourn, Daryl D. Harms, C. Colbourn, 1993, Networks.

Evaluating performability: Most probable states and bounds

Charles J. Colbourn, Daryl D. Harms, 1993, Telecommun. Syst..

Assessing Reliability of Multistage Interconnection Networks

Charles J. Colbourn, Miro Kraetzl, John S. Devitt, 1993, IEEE Trans. Computers.

Networks and Reliability in Maple

Charles J. Colbourn, John S. Devitt, Daryl D. Harms, 1992, Computational Support for Discrete Mathematics.

Network Reliability: Experiments with a Symbolic Algebra Environment

M. Kraetzl, Daryl D. Harms, M. Kraetzl, 1995 .

Reliability polynomials can cross twice

Daryl D. Harms, C. Colbourn, W. Myrvold, 1993 .

The Leggett bounds for network reliability

Charles J. Colbourn, Daryl D. Harms, D. D. Harms, 1985 .