Demo Data from EDBT 2026 / reviewers in the wild / expert
James W. Snively Jr.
dblp:134/3697
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1968
—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 · 87% Information theory · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › source coding
optimal encoding |
0.0 | 1 | 1968 | Optimal algorithmic encoding schemes for information sources · IEEE Trans. Inf. Theory 1968 |
Coding theory
source coding |
0.0 | 1 | 1968 | Optimal algorithmic encoding schemes for information sources · IEEE Trans. Inf. Theory 1968 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1968 | Optimal algorithmic encoding schemes for information sourcesabstractSequences of integers which represent the output of a time sampled and quantized information source are considered. If the sequences are known to have first differences less than a given positive integersor if they are known to be monotonic (either increasing or decreasing) and have first differences satisfying the above property, optimal encoding schemes are presented, in terms ofs, the number of samplesm, and the number of quantization levelsq. The encoding schemes are presented as simple algorithms which may be implemented in a special purpose computer on board scientific spacecraft. James W. Snively Jr. |
IEEE Trans. Inf. Theory | 1 |