Author: Tonon Fulvio
Publisher: Springer Publishing Company
ISSN: 1385-3139
Source: Reliable Computing, Vol.13, Iss.2, 2007-04, pp. : 195-209
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Calculating reliability of the recursively definable networks
Automation and Remote Control, Vol. 71, Iss. 7, 2010-07 ,pp. :
New lower bounds on the cost of binary search trees
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :
Constant bounds on the moments of the height of binary search trees
By Robson J.M.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :