Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2018
- Elisabeth Baseman, Nathan DeBardeleben, Sean Blanchard, Juston S. Moore, Olena Tkachenko, Kurt B. Ferreira, Taniya Siddiqua, Vilas Sridharan:
Physics-Informed Machine Learning for DRAM Error Modeling. DFT 2018: 1-6 - Ludovica Bozzoli, Luca Sterpone:
MATS**: An On-Line Testing Approach for Reconfigurable Embedded Memories. DFT 2018: 1-6 - Lake Bu, Hai Cheng, Michel A. Kinsy:
Fast Dynamic Device Authentication Based on Lorenz Chaotic Systems. DFT 2018: 1-6 - Glenn H. Chapman, Rohan Thomas, Klinsmann J. Coelho Silva Meneses, Israel Koren, Zahava Koren:
Analysis of Single Event Upsets Based on Digital Cameras with Very Small Pixels. DFT 2018: 1-6 - Alexandre Coelho, Amir Charif, Nacer-Eddine Zergainoh, Raoul Velazco:
A Runtime Fault-Tolerant Routing Scheme for Partially Connected 3D Networks-on-Chip. DFT 2018: 1-6 - Abhishek Das, Nur A. Touba:
Efficient Non-Binary Hamming Codes for Limited Magnitude Errors in MLC PCMs. DFT 2018: 1-6 - Andrea Floridia, Ernesto Sánchez:
Hybrid On-Line Self-Test Strategy for Dual-Core Lockstep Processors. DFT 2018: 1-6 - Gianluca Furano, Antonis Tavoularis, Lucana Santos, Veronique Ferlet-Cavrois, Cesar Boatella, Ruben Garcia Alia, Pablo Fernández-Martínez, Maria Kastriotou, Vanessa Wyrwoll, Salvatore Danzeca, Maris Tali, Dejan Gacnik, Iztok Kramberger, Lars Juul, Konstantinos Maragos, George Lentaris:
FPGA SEE Test with Ultra-High Energy Heavy Ions. DFT 2018: 1-4 - Zhen Gao, Lina Yan, Jinhua Zhu, Ruishi Han, Pedro Reviriego:
Analysis of the Effects of Single Event Upsets (SEUs) on User Memory in FPGA Implemented Viterbi Decoders. DFT 2018: 1-6 - Vishal Gupta, Saurabh Khandelwal, Jimson Mathew, Marco Ottavi:
45nm Bit-Interleaving Differential 10T Low Leakage FinFET Based SRAM with Column-Wise Write Access Control. DFT 2018: 1-6 - Pavan Kumar Javvaji, Spyros Tragoudas:
A Method to Model Statistical Path Delays for Accurate Defect Coverage. DFT 2018: 1-6 - Pilin Junsangsri, Fabrizio Lombardi:
Multiple Fault Detection in Nano Programmable Logic Arrays. DFT 2018: 1-6 - Semiu A. Olowogemo, William H. Robinson, Daniel B. Limbrick:
Effects of Voltage and Temperature Variations on the Electrical Masking Capability of Sub-65 nm Combinational Logic Circuits. DFT 2018: 1-6 - Georgios Ioannis Paliaroutis, Pelopidas Tsoumanis, Nestor E. Evmorfopoulos, George Dimitriou, Georgios I. Stamoulis:
A Placement-Aware Soft Error Rate Estimation of Combinational Circuits for Multiple Transient Faults in CMOS Technology. DFT 2018: 1-6 - Danilo Pellegrini, Marco Ottavi, Eugenio Martinelli, Corrado Di Natale:
Complementary Resistive Switch Sensing. DFT 2018: 1-5 - Irith Pomeranz:
Postprocessing Procedure for Reducing the Faulty Switching Activity of a Low-Power Test Set. DFT 2018: 1-6 - Puneet Ramesh Savanur, Spyros Tragoudas:
Threshold Voltage Extraction Using Static NBTI Aging. DFT 2018: 1-6 - Markus Schütz, Andreas Steininger, Florian Huemer, Jakob Lechner:
State Recovery for Coarse-Grain TMR Designs in FPGAs Using Partial Reconfiguration. DFT 2018: 1-6 - Zois-Gerasimos Tasoulas, Ryan Guss, Iraklis Anagnostopoulos:
Performance-Based and Aging-Aware Resource Allocation for Concurrent GPU Applications. DFT 2018: 1-6 - Marcello Traiola, Arnaud Virazel, Patrick Girard, Mario Barbareschi, Alberto Bosio:
Investigation of Mean-Error Metrics for Testing Approximate Integrated Circuits. DFT 2018: 1-6 - Naixing Wang, Irith Pomeranz, Brady Benware, M. Enamul Amyeen, Srikanth Venkataraman:
Improving the Resolution of Multiple Defect Diagnosis by Removing and Selecting Tests. DFT 2018: 1-6 - Mark Wilkening, Fritz Previlon, David R. Kaeli, Sudhanva Gurumurthi, Steven Raasch, Vilas Sridharan:
Evaluating the Resilience of Parallel Applications. DFT 2018: 1-6 - Yuta Yamamoto, Kazuteru Namba:
Construction of Latch Design with Complete Double Node Upset Tolerant Capability Using C-Element. DFT 2018: 1-6 - 2018 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, DFT 2018, Chicago, IL, USA, October 8-10, 2018. IEEE Computer Society 2018, ISBN 978-1-5386-8398-9 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-03 17:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint