Demo Data from VLDB 2026 / reviewers in the wild / expert
A. Ja. Shalaev
dblp:93/3799
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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 · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 4 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 › fault diagnosis
diagnosability |
0.0 | 1 | 1994 | Comments on "An O(n^2.5) Fault Identification Algorithm for Diagnosable Systems" · IEEE Trans. Computers 1994 |
Electronic design automation › hardware verification and test
fault diagnosis |
0.0 | 1 | 1994 | Comments on "An O(n^2.5) Fault Identification Algorithm for Diagnosable Systems" · IEEE Trans. Computers 1994 |
Electronic design automation › hardware verification and test › fault diagnosis › fault model-based diagnosis
PMC model |
0.0 | 1 | 1994 | Comments on "An O(n^2.5) Fault Identification Algorithm for Diagnosable Systems" · IEEE Trans. Computers 1994 |
Computational complexity › complexity classes › coNP
coNP-completeness |
0.0 | 1 | 1994 | Comments on "An O(n^2.5) Fault Identification Algorithm for Diagnosable Systems" · IEEE Trans. Computers 1994 |
Methods — techniques the papers use, named apart from their topics
graph-theoretic analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Comments on "An O(n^2.5) Fault Identification Algorithm for Diagnosable Systems"abstractFor original paper see A.T. Dahbura and G.M. Masson, "An O(n/sup 2.5/) fault identification algorithm for diagnosable systems," IEEE Trans. Comput., vol. C-33, pp. 486-492, Jun. 1984. Dahbura and Masson suggested an alternative version of Hakimi-Amin's theorem about the necessary and sufficient conditions for the system, described by PMC model (1967), to be t/sub p/-diagnosable. The authors found systems with connection assignment that satisfy conditions of Dahbura-Masson's theorem but are not t/sub p/-diagnosable. In this correspondence they state the additional condition under which Dahbura-Masson's theorem will hold.> V. Tz. Radoytchevsky, A. Ja. Shalaev |
IEEE Trans. Computers | 2 |