
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B. Krishnamurthy, I.G. Tollis, "Improved Techniques for Estimating Signal Probabilities," IEEE Transactions on Computers, vol. 38, no. 7, pp. 10411045, July, 1989.  
BibTex  x  
@article{ 10.1109/12.30854, author = {B. Krishnamurthy and I.G. Tollis}, title = {Improved Techniques for Estimating Signal Probabilities}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {7}, issn = {00189340}, year = {1989}, pages = {10411045}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.30854}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Improved Techniques for Estimating Signal Probabilities IS  7 SN  00189340 SP1041 EP1045 EPD  10411045 A1  B. Krishnamurthy, A1  I.G. Tollis, PY  1989 KW  signal probabilities estimation; random satisfiability; Monte Carlo techniques; firstorder effects; fault location; logic design; logic testing; Monte Carlo methods. VL  38 JA  IEEE Transactions on Computers ER   
[1] F. Brglez, "On testability analysis of combinational networks," inProc. IEEE Symp. Circuits Syst., 1984, pp. 221225.
[2] F. Brglez and H. Fujiwara, "A neutral netlist of 10 combinational benchmark circuits and a target translator in Fortran," inProc. IEEE Int. Symp. Circuits Syst., June 1985.
[3] R. K. Gaeda, M. R. Mercer, and B. Underwood, "Calculation of greatest lower bounds obtainable by the cutting algorithm," inProc. Int. Test Conf., 1986, pp. 498505.
[4] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[5] R. M. Karp and M. Luby, "MonteCarlo algorithms for enumeration and reliability problems," inProc. IEEE Symp. Foundations Comput. Sci., 1983, pp. 5664.
[6] D. E. Knuth, "Estimating the efficiency of backtrack programs,"Math Comput., vol. 29, pp. 121136, 1975.
[7] B. Krishnamurthy, "Short proofs for tricky formulas,"Acta Inform., vol. 22, pp. 253275, 1985.
[8] E. J. McCluskey, "Probability models for logic networks," inProc. Manitoba Conf. Numer. Math., 1974, pp. 2128.
[9] K. P. Parker and E. J. McCluskey, "Analysis of logic circuits with faults using input signal probabilities,"IEEE Trans. Comput., vol. C24, pp. 573578, 1975.
[10] K. P. Parker and E. J. McCluskey, "Probabilistic treatment of general combinational networks,"IEEE Trans. Comput., vol. C24, pp. 668670, 1975.
[11] J. Savir, G. Ditlow, and P. H. Bardell, "Random pattern testability," inProc. IEEE Symp. Fault Tolerant Comput., 1983, pp. 8089.
[12] S. C. Seth, L. Pan, and V. D. Agrawal, "PREDlCTProbabilistic estimation of digital circuit testability," inProc. FTCS15, Ann Arbor, MI, June 1985, pp. 220225.
[13] L. Stockmeyer, "On approximation algorithms for #P,"SIAM J. Comput., vol. 14, pp. 849861, 1985.
[14] T. W. Williams and K. P. Parker, "Design for testabilityA survey,"IEEE Trans. Comput., vol. C31, pp. 215, 1982.