default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValentina Andreeva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2022
[c13]Andrey Laputenko, Nina Yevtushenko, Valentina Andreeva
, Anzhela Yu. Matrosova:
Deriving FSM-based tests using $a, b-\text{faults}$ for Logic Circuits. ISVLSI 2022: 80-85- 2021
- [c12]Anjela Yu. Matrosova, Valentina Andreeva, V. Tychinskiy:
SAT Solvers Application of Deriving All Test Pairs Detecting Robust Testable PDFs. EWDTS 2021: 1-4 - 2019
- [c11]Anjela Yu. Matrosova, Valentina Andreeva, V. Tychinskiy:
Deriving Low Power Test Sequences Detecting Robust Testable PDFs. EWDTS 2019: 1-4 - 2018
- [c10]Sergey Ostanin, Valentina Andreeva, Natalia Butorina, D. Tretyakov:
Fault-Tolerant Synchronous FSM Network Design for Path Delay Faults. EWDTS 2018: 1-4 - 2017
- [c9]Valentina Andreeva, Semyon Chernyshov:
Finding the shortest transfer sequence of sequential circuit based on simplified ROBDDs. EWDTS 2017: 1-3 - 2016
- [c8]Anjela Yu. Matrosova, Sergey Ostanin, Valentina Andreeva:
Patching circuit design based on reserved CLBs. AQTR 2016: 1-5 - [c7]Anzhela Yu. Matrosova, Valentina Andreeva, Alexey Melnikov:
ROBDDs application for finding the shortest transfer sequence of sequential circuit or only revealing existence of this sequence without deriving the sequence itself. EWDTS 2016: 1-4 - 2015
- [c6]Anzhela Yu. Matrosova, Valentina Andreeva, V. Tomkov:
Fully delay and multiple stuck-at faults testable FSM design. EWDTS 2015: 1-4 - 2014
- [c5]Valentina Andreeva, Kirill A. Sorudeykin:
Decomposition tree - based compaction procedure with iteration steps for interconversional layouts of tasks. EWDTS 2014: 1-6 - 2013
- [c4]Valentina Andreeva, Kirill A. Sorudeykin:
A research of heuristic optimization approaches to the test set compaction procedure based on a decomposition tree for combinational circuits. EWDTS 2013: 1-6 - 2011
- [c3]Valentina Andreeva:
Test set compaction procedure for combinational circuits based on decomposition tree. EWDTS 2011: 251-254 - 2010
- [c2]Valentina Andreeva:
Test minimization technique for multiple stuck-at faults of combinational circuit. EWDTS 2010: 168-170 - 2002
- [c1]Anzhela Yu. Matrosova, Valentina Andreeva, Yu. Sedov:
Survivable Discrete Circuits Design. IOLTW 2002: 13-
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-24 23:11 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:
