| 1987 |
|---|
| 10 | | Dominique Snyers,
André Thayse:
From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions
Springer 1987 |
| 1986 |
|---|
| 9 | | Dominique Snyers,
André Thayse:
Algorithmic State Machine Design and Automatic Theorem Proving: Dual Approaches to the Same Activity.
IEEE Trans. Computers 35(10): 853-861 (1986) |
| 1984 |
|---|
| 8 | | André Thayse:
P-Functions and Boolean Matrix Factorization: A Unified Approach for Wired, Programmed and Microprogrammed Implementations of Discrete Algorithms
Springer 1984 |
| 7 | | André Thayse:
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept.
IEEE Trans. Computers 33(10): 861-868 (1984) |
| 6 | | André Thayse:
A Matrix Formalism for Asynchronous Implementation of Algorithms.
IEEE Trans. Computers 33(4): 289-300 (1984) |
| 1982 |
|---|
| 5 | | André Thayse:
Synthesis and Optimization of Programs by Means of P-Funktions.
IEEE Trans. Computers 31(1): 34-40 (1982) |
| 1981 |
|---|
| 4 | | André Thayse:
Boolean Caclulus of Differences
Springer 1981 |
| 3 | | André Thayse:
P-Functions: A New Tool for the Analysis and Synthesis of Binary Programs.
IEEE Trans. Computers 30(2): 126-134 (1981) |
| 1978 |
|---|
| 2 | | André Thayse:
Meet and Join Derivatives and Their Use in Switching Theory.
IEEE Trans. Computers 27(8): 713-720 (1978) |
| 1977 |
|---|
| 1 | | André Thayse,
Jean-Pierre Deschamps:
Logic Properties of Unate Discrete and Switching Functions.
IEEE Trans. Computers 26(12): 1202-1212 (1977) |
