Demo Data from EDBT 2026 / reviewers in the wild / expert
Zinovy Reichstein
dblp:156/3125
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1986
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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.
| Theoretical computer science
1 paper |
Coding theory · 100% | |
| Computer networks
1 paper |
Internet architecture and protocols · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
error-correcting codes |
0.0 | 1 | 1986 | Configurations for File Transfer Protocol Error Protection · IEEE Trans. Commun. 1986 |
Internet architecture and protocols › layered network architecture › application-layer protocols
file transfer protocol |
0.0 | 1 | 1986 | Configurations for File Transfer Protocol Error Protection · IEEE Trans. Commun. 1986 |
Methods — techniques the papers use, named apart from their topics
distance properties optimization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1986 | Configurations for File Transfer Protocol Error ProtectionabstractThis note considers codes for computer file transfer protocols when only upper-case ASCII characters are used as control characters. Such a restriction may be necessary to avoid dependence on unique machine features and to promote portability. If ten control functions are needed, a number used in a typical sufficiently rich protocol, we seek a subset of ten upper-case ASCII characters with good distance properties. The control functions form themselves naturally into three groups. Recognizing that only even distances can occur, we wish to make the intragroup minimum distances as large as possible, and the number of control characters having distance 2 as small as possible. We find the optimum solution to the above problem and an assignment that attains the optimum. The codes are essentially unique. Edward C. Posner, Zinovy Reichstein |
IEEE Trans. Commun. | 2 |