Deutsch
Home
Search
Browse
Submit
Sitemap
Schließen
Organizational units
Mathematisch-Naturwissenschaftliche Fakultät
Institut für Informatik und Computational Science
Refine
Has Fulltext
no
(36)
Author
Schaub, Torsten
(13)
Gössel, Michael
(12)
Saposhnikov, V. V.
(5)
Sogomonyan, Egor S.
(5)
Horn, Erika
(4)
Nicolas, Pascal
(4)
Saposhnikov, Vl. V.
(4)
Besnard, Philippe
(3)
Börner, Ferdinand
(3)
Jürgensen, Helmut
(3)
+ more
Year of publication
1998 (36)
(remove)
Document Type
Article
(30)
Monograph/Edited Volume
(6)
Language
English
(29)
German
(6)
French
(1)
Is part of the Bibliography
yes (36)
(remove)
Institute
Institut für Informatik und Computational Science
(36)
36
search hits
1
to
10
Export
BibTeX
CSV
RIS
XML
10
10
20
50
100
Sort by
Year
Year
Title
Title
Author
Author
A multi-mode scannable memory element for high test application efficiency and delay testing
(1998)
Sogomonyan, Egor S.
;
Singh, Adit D.
;
Gössel, Michael
A new design method for self-checking unidirectional combinational circuits
(1998)
Saposhnikov, V. V.
;
Morosov, Andrej
;
Saposhnikov, Vl. V.
;
Gössel, Michael
A remark on the finite lattice representation problem
(1998)
Börner, Ferdinand
A scan based concrrent BIST approach for low cost on-line testing
(1998)
Sogomonyan, Egor S.
;
Singh, Adit D.
;
Gössel, Michael
A structural approach for space compaction for concurrent checking and BIST
(1998)
Seuring, Markus
;
Gössel, Michael
;
Sogomonyan, Egor S.
A structural approach for space compaction for sequential circuits
(1998)
Seuring, Markus
;
Gössel, Michael
An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem.
(1998)
Linke, Thomas
;
Schaub, Torsten
Architekturtypen für Agentenanwendungssysteme
(1998)
Horn, Erika
;
Kupries, Mario
;
Reinke, Thomas
Built-in self-Test with an alternating output
(1998)
Bogue, Ted
;
Gössel, Michael
;
Jürgensen, Helmut
;
Zorian, Yervant
Characterization of non-monotone non-constructive systems
(1998)
Besnard, Philippe
;
Schaub, Torsten
1
to
10
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this.
You can find our privacy policy here.