EDBT 2026 Demo / reviewers in the wild / expert
D. A. R. Seeley
dblp:01/2822
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1967
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author
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.
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
sardinas-patterson criterion |
0.0 | 1 | 1967 | A Short Note on Bandyopadhyay's Proof of the Decipherability Criterion of Sardinas and Patterson · Inf. Control. 1967 |
Coding theory › error-correcting codes
uniquely decodable codes |
0.0 | 1 | 1967 | A Short Note on Bandyopadhyay's Proof of the Decipherability Criterion of Sardinas and Patterson · Inf. Control. 1967 |
Coding theory › source coding
variable-length codes |
0.0 | 1 | 1967 | A Short Note on Bandyopadhyay's Proof of the Decipherability Criterion of Sardinas and Patterson · Inf. Control. 1967 |
Methods — techniques the papers use, named apart from their topics
formal proof · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1967 | A Short Note on Bandyopadhyay's Proof of the Decipherability Criterion of Sardinas and Patterson
D. A. R. Seeley |
Inf. Control. | 1 |