default search action
André Thayse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
- [j13]André Thayse:
Reply to Bringsjord and Ferrucci. Minds Mach. 8(2): 311-312 (1998) - 1996
- [b4]André Thayse:
From natural language processing to logic for expert systems - a logic based approach to artificial intelligence. Wiley 1996
1980 – 1989
- 1987
- [b3]Dominique Snyers, André Thayse:
From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions. Lecture Notes in Computer Science 271, Springer 1987, ISBN 3-540-18217-9 - 1986
- [j12]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
- [b2]André Thayse:
P-Functions and Boolean Matrix Factorization: A Unified Approach for Wired, Programmed and Microprogrammed Implementations of Discrete Algorithms. Lecture Notes in Computer Science 175, Springer 1984, ISBN 3-540-13358-5 - [j11]André Thayse:
A Matrix Formalism for Asynchronous Implementation of Algorithms. IEEE Trans. Computers 33(4): 289-300 (1984) - [j10]André Thayse:
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept. IEEE Trans. Computers 33(10): 861-868 (1984) - 1982
- [j9]André Thayse:
Synthesis and Optimization of Programs by Means of P-Funktions. IEEE Trans. Computers 31(1): 34-40 (1982) - 1981
- [b1]André Thayse:
Boolean Caclulus of Differences. Lecture Notes in Computer Science 101, Springer 1981, ISBN 3-540-10286-8 - [j8]André Thayse:
Universal algorithms for evaluating boolean functions. Discret. Appl. Math. 3(1): 53-65 (1981) - [j7]André Thayse:
P-Functions: A New Tool for the Analysis and Synthesis of Binary Programs. IEEE Trans. Computers 30(2): 126-134 (1981)
1970 – 1979
- 1979
- [j6]André Thayse:
Discrete function expansions in integer powers. Discret. Appl. Math. 1(1-2): 127-136 (1979) - [j5]André Thayse:
Encoding of parallel program schemata by vector addition systems. Int. J. Parallel Program. 8(3): 209-218 (1979) - 1978
- [j4]André Thayse:
Meet and Join Derivatives and Their Use in Switching Theory. IEEE Trans. Computers 27(8): 713-720 (1978) - [c1]André Thayse, Marc Davio, Jean-Pierre Deschamps:
Optimization of multivalued decision algorithms. MVL 1978: 171-178 - 1977
- [j3]André Thayse, Jean-Pierre Deschamps:
Logic Properties of Unate Discrete and Switching Functions. IEEE Trans. Computers 26(12): 1202-1212 (1977) - 1976
- [j2]André Thayse:
Difference operators and extended truth vectors for discrete functions. Discret. Math. 14(2): 171-202 (1976) - 1973
- [j1]André Thayse, Marc Davio:
Boolean Differential Calculus and its Application to Switching Theory. IEEE Trans. Computers 22(4): 409-420 (1973)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: