default search action
Vitalij Ocheretnij
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [j2]Vitalij Ocheretnij, Michael Gössel, Egor S. Sogomonyan, Daniel Marienfeld:
Modulo p=3 Checking for a Carry Select Adder. J. Electron. Test. 22(1): 101-107 (2006) - [c14]Daniel Marienfeld, Egor S. Sogomonyan, Vitalij Ocheretnij, Michael Gössel:
A New Self-Checking and Code-Disjoint Non-Restoring Array Divider. IOLTS 2006: 23-30 - 2005
- [c13]Daniel Marienfeld, Egor S. Sogomonyan, Vitalij Ocheretnij, Michael Gössel:
New Self-checking Output-Duplicated Booth Multiplier with High Fault Coverage for Soft Errors. Asian Test Symposium 2005: 76-81 - [c12]Vitalij Ocheretnij, G. Kouznetsov, Ramesh Karri
, Michael Gössel:
On-Line Error Detection and BIST for the AES Encryption Algorithm with Different S-Box Implementations. IOLTS 2005: 141-146 - 2004
- [j1]Michael Gössel, Krishnendu Chakrabarty
A Signature Analysis Technique for the Identification of Failing Vectors with Application to Scan-BIST. J. Electron. Test. 20(6): 611-622 (2004) - [c11]Egor S. Sogomonyan, Daniel Marienfeld, Vitalij Ocheretnij, Michael Gössel:
Self-checking Carry-selectAdder with Sum-bit Duplication. ARCS Workshops 2004: 84-91 - [c10]Egor S. Sogomonyan, Daniel Marienfeld, Vitalij Ocheretnij, Michael Gössel:
A New Self-Checking Sum-Bit Duplicated Carry-Select Adder. DATE 2004: 1360-1361 - [c9]Daniel Marienfeld, Egor S. Sogomonyan, Vitalij Ocheretnij, Michael Gössel:
A new self-checking multiplier by use of a code-disjoint sum-bit duplicated adder. ETS 2004: 30-35 - [c8]Vitalij Ocheretnij, Daniel Marienfeld, Egor S. Sogomonyan, Michael Gössel:
Self-Checking Code-Disjoint Carry-Select Adder with Low Area Overhead by Use of Add1-Circuits. IOLTS 2004: 31-36 - 2003
- [c7]Vitalij Ocheretnij, Michael Gössel, Egor S. Sogomonyan, Daniel Marienfeld:
A Modulo p Checked Self-Checking Carry Select Adder. IOLTS 2003: 25-29 - 2002
- [c6]Daniel Marienfeld, Vitalij Ocheretnij, Michael Gössel, Egor S. Sogomonyan:
Partially Duplicated Code-Disjoint Carry-Skip Adder. DFT 2002: 78-86 - [c5]Daniel Marienfeld, Egor S. Sogomonyan, Vitalij Ocheretnij, Michael Gössel:
A New Self-Checking Code-Disjoint Carry-Skip Adder. IOLTW 2002: 39-43 - 2001
- [c4]Michael Gössel, Vitalij Ocheretnij, S. Chakrabarty:
Diagnosis by Repeated Application of Specific Test Inputs and by Output Monitoring of the MISA. Asian Test Symposium 2001: 57-62 - [c3]Vitalij Ocheretnij, Egor S. Sogomonyan, Michael Gössel:
A New Code-Disjoint Sum-Bit Duplicated Carry Look-Ahead Adder for Parity Codes. Asian Test Symposium 2001: 365- - [c2]Vitalij Ocheretnij, Michael Gössel, Egor S. Sogomonyan:
Code-Disjoint Carry-Dependent Sum Adder with Partial Look-Ahead. IOLTW 2001: 147-152 - 2000
- [c1]Vitalij Ocheretnij, Michael Gössel, Vladimir V. Saposhnikov, Valerij V. Saposhnikov:
A New Method of Redundancy Addition for Circuit Optimization. EUROMICRO 2000: 1172-
Coauthor Index
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:44 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: