BOOLEAN CALCULUS OF DIFFERENCESTHAYSE A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 101; 151 P.; BIBL. 9 P.Serial Issue

APPLICATIONS OF DISCRETE FUNCTIONS. II. TRANSIENT ANALYSIS OF ASYNCHRONOUS SWITCHING NETWORKS.THAYSE A.1974; PHILIPS RES. REP.; NETHERL.; DA. 1974; VOL. 29; NO 2; PP. 155-192; BIBL. 21 REF.Article

BOOLEAN DIFFERENCE CALCULUSTHAYSE A.1980; DIGIT. PROCESSES; ISSN 0301-4185; CHE; DA. 1980; VOL. 6; NO 2-3; PP. 175-184; ABS. FRE/GER; BIBL. 9 REF.Article

MEET AND JOIN DERIVATIVES AND THEIR USE IN SWITCHING THEORY = DERIVES D'INTERSECTION ET DE REUNION ET LEUR UTILISATION EN THEORIE DE LA COMMUTATIONTHAYSE A.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 8; PP. 713-720; BIBL. 9 REF.Article

DIFFERENTIAL CALCULUS FOR FUNCTIONS FROM (GF(P))^N INTO GF(P).THAYSE A.1974; PHILIPS RES. REP.; NETHERL.; DA. 1974; VOL. 29; NO 6; PP. 560-586; BIBL. 22 REF.Article

MULTIPLE-FAULT DETECTION IN LARGE LOGICAL NETWORKSTHAYSE A.1972; PHILIPS RES. REP.; NETHERL.; DA. 1972; VOL. 27; NO 6; PP. 583-602; BIBL. 12 REF.Serial Issue

SYNTHESIS AND OPTIMIZATION OF PROGRAMS BY MEANS OF P-FUNCTIONSTHAYSE A.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 1; PP. 34-40; BIBL. 15 REF.Article

TAYLOR EXPANSIONS OF BOOLEAN FUNCTIONS AND TEST FUNCTIONS FOR SWITCHING NETWORKS = DEVELOPPEMENTS DE TAYLOR DES FONCTIONS BOOLEENNES ET FONCTIONS DE TEST POUR LES CIRCUITS DE COMMUTATIONTHAYSE A.1979; PHILIPS J. RES.; NLD; DA. 1979; VOL. 34; NO 3-4; PP. 143-146; BIBL. 4 REF.Article

STATIC-HAZARD DETECTION IN SWITCHING CIRCUITS BY PRIME-IMPLICANT EXAMINATION IN FUZZY FUNCTIONS.THAYSE A.1977; ELECTRON. LETTERS; G.B.; DA. 1977; VOL. 13; NO 4; PP. 94-96; BIBL. 11 REF.Article

Synthesis and asynchronous implementation of algorithms using a generalized P-function conceptTHAYSE, A.IEEE transactions on computers. 1984, Vol 33, Num 10, pp 861-868, issn 0018-9340Article

SYMBOLIC COMPUTATION OF FOURIER TRANSFORMS OF BOOLEAN FUNCTIONSDAVIO M; THAYSE A; BIOUL G et al.1972; PHILIP RES. REP.; NETHERL.; DA. 1972; VOL. 27; NO 4; PP. 386-403; BIBL. 5 REF.Serial Issue

Algorithmic state machine design and automatic theorem proving: two dual approaches to the same activitySNYERS, D; THAYSE, A.IEEE transactions on computers. 1986, Vol 35, Num 10, pp 853-861, issn 0018-9340Article

From logic design to logic programming: theorem proving techniques and P-functionsSNYERS, D; THAYSE, A.Lecture notes in computer science. 1987, Vol 271, issn 0302-9743, IV-125 pSerial Issue