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
(26)
Author
Gössel, Michael
(14)
Saposhnikov, V. V.
(6)
Kupries, Mario
(5)
Saposhnikov, Vl. V.
(5)
Schaub, Torsten H.
(5)
Seuring, Markus
(4)
Sogomonyan, Egor S.
(4)
Morosov, Andrej
(3)
Benhammadi, Farid
(2)
Brüning, Stefan
(2)
+ more
Year of publication
1999 (26)
(remove)
Document Type
Article (26)
(remove)
Language
English (26)
(remove)
Is part of the Bibliography
yes
(26)
Institute
Institut für Informatik und Computational Science
(26)
26
search hits
1
to
26
Export
BibTeX
CSV
RIS
XML
100
10
20
50
100
Sort by
Year
Year
Title
Title
Author
Author
Query-answering in prioritized default logic
(1999)
Benhammadi, Farid
;
Nicolas, Pascal
;
Schaub, Torsten H.
Query-answering in prioritized default logic
(1999)
Benhammadi, Farid
;
Nicolas, Pascal
;
Schaub, Torsten H.
Avoiding non-ground variables
(1999)
Brüning, Stefan
;
Schaub, Torsten H.
A voiding non-ground variables
(1999)
Brüning, Stefan
;
Schaub, Torsten H.
Concurrent checking of sequential circuits by alternating inputs
(1999)
Dimitriev, Alexej
;
Saposhnikov, V. V.
;
Saposhnikov, Vl. V.
;
Gössel, Michael
Self-dual sequential circuits for concurrent chechking
(1999)
Dmitriev, Alexej
;
Saposhnikov, V. V.
;
Saposhnikov, Vl. V.
;
Gössel, Michael
A new method of redundancy addition for circuit optimization
(1999)
Gössel, Michael
New totally self-checking ripple and carry look-ahead adders
(1999)
Gössel, Michael
;
Sogomonyan, Egor S.
A new totally error propagating compactor for arbitrary cores with digital interfaces
(1999)
Gössel, Michael
;
Sogomonyan, Egor S.
;
Morosov, Andrej
Properties and models of software agents and prefabrication for agent application systems
(1999)
Horn, Erika
;
Kupries, Mario
;
Reinke, Thomas
ADE : An architecture type-based development environment for agent application systems
(1999)
Kupries, Mario
Connector-aided coordination in agent systems
(1999)
Kupries, Mario
Software architecture type-based interagent connections
(1999)
Kupries, Mario
;
Noseleit, Christof
On bottom-up pre-processing techniques for automated default reasoning
(1999)
Linke, Thomas
;
Schaub, Torsten H.
Reduced area overhead of the input party for code-disjoint circuits
(1999)
Morosov, Andrej
;
Gössel, Michael
;
Hartje, Hendrik
Cell replication and redundancy elimination during placement for cycle time optimization
(1999)
Neumann, I.
;
Stoffel, Dominik
;
Hartje, Hendrik
;
Kunz, Wolfgang
Fault-tolerant self-dual circuits
(1999)
Otscheretnij, Vitalij
;
Saposhnikov, Vl. V.
;
Saposhnikov, V. V.
;
Gössel, Michael
An architecture type-based development environment for agent application systems
(1999)
Reinke, Thomas
;
Glöde, Dirk
;
Lauert, Alexander
;
Kupries, Mario
;
Horn, Erika
A method of construction of combinational self-checking units with detection of all single faults
(1999)
Saposhnikov, V. V.
;
Saposhnikov, Vl. V.
;
Gössel, Michael
;
Morosov, Andrej
Modified TMR-system with reduced hardware overhead
(1999)
Saposhnikov, Vl. V.
;
Ocheretnij, V.
;
Saposhnikov, V. V.
;
Gössel, Michael
Experimental results for self-dual multi-output combinational circuits
(1999)
Saposhnikov, Vl. V. V. V.
;
Moshanin, Vl.
;
Saposhnikov, V. V.
;
Gössel, Michael
Built-in self test mit multi-mode scannable memory elementen
(1999)
Seuring, Markus
A structural approach for space compaction for sequential circuits
(1999)
Seuring, Markus
;
Gössel, Michael
A structural method for output compaction of sequential automata implemented as circuits
(1999)
Seuring, Markus
;
Gössel, Michael
Testability evaluation of sequential designs incorporating the multi-mode scannable memory element
(1999)
Singh, Adit D.
;
Sogomonyan, Egor S.
;
Gössel, Michael
;
Seuring, Markus
A multi-mode scannable memory element for high test application efficiency and delay testing
(1999)
Sogomonyan, Egor S.
;
Singh, Adit D.
;
Gössel, Michael
1
to
26
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.