Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jamie M. de Faria Jr.
dblp:94/3180
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1982
—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 |
Information theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › hardware verification and test
fault diagnosis |
0.0 | 1 | 1982 | Application of Information Theory to Sequential Fault Diagnosis · IEEE Trans. Computers 1982 |
Electronic design automation
hardware verification and test |
0.0 | 1 | 1982 | Application of Information Theory to Sequential Fault Diagnosis · IEEE Trans. Computers 1982 |
Information theory › estimation theory
information-theoretic experiment design |
0.0 | 1 | 1982 | Application of Information Theory to Sequential Fault Diagnosis · IEEE Trans. Computers 1982 |
Methods — techniques the papers use, named apart from their topics
information-theoretic heuristic · 0.0NP-completeness analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1982 | Application of Information Theory to Sequential Fault DiagnosisabstractIn this correspondence we consider the problem of the construction of efficient sequential fault location experiments for permanent faults. The construction of optimum sequential experiments is an NP-complete problem and, therefore, a heuristic approach for the design of near-optimum sequential experiments is considered. The approach is based on information theoretic concepts and the suggested algorithm for the construction of near-optimum sequential fault location experiments is systematic, has a sound theoretical justification, and yet has low design complexity. Pramod K. Varshney, Carlos R. P. Hartmann, Jamie M. de Faria Jr. |
IEEE Trans. Computers | 3 |