Demo Data from VLDB 2026 / reviewers in the wild / expert
Yuri V. Klimets
dblp:15/1949
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 80% Memory systems · 20% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › hardware verification and test › design for testability
built-in self-test |
0.0 | 1 | 2002 | Efficient Online and Offline Testing of Embedded DRAMs · IEEE Trans. Computers 2002 |
Memory systems
DRAM |
0.0 | 1 | 2002 | Efficient Online and Offline Testing of Embedded DRAMs · IEEE Trans. Computers 2002 |
Electronic design automation
hardware verification and test |
0.0 | 1 | 2002 | Efficient Online and Offline Testing of Embedded DRAMs · IEEE Trans. Computers 2002 |
Electronic design automation › hardware verification and test
online testing |
0.0 | 1 | 2002 | Efficient Online and Offline Testing of Embedded DRAMs · IEEE Trans. Computers 2002 |
Electronic design automation › hardware verification and test › test response compaction
signature analysis |
0.0 | 1 | 2002 | Efficient Online and Offline Testing of Embedded DRAMs · IEEE Trans. Computers 2002 |
Methods — techniques the papers use, named apart from their topics
signature analysis · 0.0error-detecting codes · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Efficient Online and Offline Testing of Embedded DRAMsabstractThis paper presents an integrated approach for both built-in online and off-line testing of embedded DRAMs. It is based on a new technique for output data compression which offers the same benefits as signature analysis during off-line test, but also supports efficient online consistency checking. The initial fault-free memory contents are compressed to a reference characteristic and compared to test characteristics periodically. The reference characteristic depends on the memory contents, but unlike similar characteristics based on signature analysis, it can be easily updated concurrently with WRITE operations. This way, changes in memory do not require a time consuming recomputation. The respective test characteristics can be efficiently computed during the periodic refresh operations of the dynamic RAM. Experiments show that the proposed technique significantly reduces the time between the occurrence of an error and its detection. Compared to error detecting codes (EDC) it also achieves a significantly higher error coverage at lower hardware costs. Therefore, it perfectly complements standard online checking approaches relying on EDC, where the concurrent detection of certain types of errors is guaranteed, but only during READ operations accessing the erroneous data. Sybille Hellebrand, Hans-Joachim Wunderlich, Alexander A. Ivaniuk, Yuri V. Klimets, Vyacheslav N. Yarmolik |
IEEE Trans. Computers | 4 |
| 1999 | Error Detecting Refreshment for Embedded DRAMsabstractThis paper presents a new technique for on-line consistency checking of embedded DRAMs. The basic idea is to use the periodic refresh operation for concurrently computing a test characteristic of the memory contents and compare it to a precomputed reference characteristic. Experiments show that the proposed technique significantly reduces the time between the occurrence of an error and its detection (error detection latency). It also achieves a very high error coverage at low hardware costs. Therefore it perfectly complements standard on-line checking approaches relying on error detecting codes, where the detection of certain types of errors is guaranteed, but only during READ operations accessing the erroneous data. Sybille Hellebrand, Hans-Joachim Wunderlich, Alexander A. Ivaniuk, Yuri V. Klimets, Vyacheslav N. Yarmolik |
VTS | 4 |
| 1998 | March PS(23N) Test for DRAM Pattern-Sensitive FaultsabstractMarch algorithms are widely used in DRAM testing. They are relatively simple yet providing high fault coverage especially with respect to stuck-at faults, address uniqueness faults, and some types of cell-interaction faults. At the same time the capability of traditional March tests to detect pattern-sensitive faults is rather limited. This paper proposes an approach to enhance March test detection capability with respect to the pattern-sensitive faults. Vyacheslav N. Yarmolik, Yuri V. Klimets, Serge N. Demidenko |
Asian Test Symposium | 2 |