Result 1 to 20 of 37 total
Using global structural relationships of signals to accelerate sat-based combinational equivalence checking. (English)
J. UCS 10, No. 12, 1597-1628, electronic only (2004).
1
Alexander duality and moments in reliability modelling. (English)
Appl. Algebra Eng. Commun. Comput. 14, No.3, 153-174 (2003).
2
Power-constrained testing of VLSI circuits. (English)
Frontiers in Electronic Testing. 22. Boston, MA: Kluwer Academic Publishers. xi, 178 p. EUR 107.00; \$ 105.00; \sterling 67.00 (2003).
3
Estimation of circuit output measurements including statistically dependent parameters. (English)
Int. J. Circuit Theory Appl. 31, No.2, 219-228 (2003).
4
On the identification of sets of points in the square lattice. (English)
Discrete Comput. Geom. 29, No.1, 139-152 (2003).
5
Efficient calculation of the Reed-Muller form means of the Walsh transform. (English)
Int. J. Appl. Math. Comput. Sci. 12, No.4, 571-579 (2002).
6
Stochastic orders in partition and random testing of software. (English)
J. Appl. Probab. 39, No.3, 555-565 (2002).
7
Automatic derivation of timing constraints by failure analysis. (English)
Brinksma, Ed (ed.) et al., Computer aided verification. 14th international conference, CAV 2002, Copenhagen, Denmark, July 27-31, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2404, 195-208 (2002).
8
Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets. (English)
J. Franklin Inst. 339, No.4-5, 387-430 (2002).
9
A generalized fault diagnosis method in dynamic analogue circuits. (English)
Int. J. Circuit Theory Appl. 30, No.5, 487-510 (2002).
10
Effective diagnostics of failures in automata networks. (Russian)
Diskretn. Anal. Issled. Oper., Ser. 1 9, No.3, 48-74 (2002).
11
On the density of identifying codes in the square lattice. (English)
J. Comb. Theory, Ser. B 85, No.2, 297-306 (2002).
12
Optimal codes for strong identification. (English)
Eur. J. Comb. 23, No.3, 307-313 (2002).
13
Robust fault detection using Luenberger-type unknown input observers ‒ a parametric approach. (English)
Int. J. Syst. Sci. 32, No.4, 533-540 (2001).
14
Fault tolerance in computing, compressing, and transmitting FFT data. (English)
IEEE Trans. Commun. 49, No.12, 2095-2105 (2001).
15
Fault simulation in multi-valued logic networks. (English)
Mult.-Valued Log. 7, No.1-2, 25-47 (2001).
16
Approximate evaluations of characteristic polynomials of Boolean functions. (English)
Theor. Comput. Sci. 262, No.1-2, 37-68 (2001).
17
Automatic design error correction of combinatorial circuits. (English)
Berlin: Logos Verlag. Tübingen: Univ. Tübingen, Fakultät Informatik (2000), 178 p. (2001).
18
On the undetected error probability of $m$-out-of-$n$ codes on the binary symmetric channel. (English)
Buchmann, Johannes (ed.) et al., Coding theory, cryptography and related areas. Proceedings of an international conference, Guanajuato, Mexico, April 1998. Berlin: Springer. 102-110 (2000).
19
Diagnosing crosstalk faults in a class of dilated blocking optical multistage interconnection networks. (English)
Inf. Sci. 124, No.1-4, 59-91 (2000).
20
Result 1 to 20 of 37 total
Start
Contact
Print
General Help
