Demo Data from EDBT 2026 / reviewers in the wild / expert
Stanislav I. Samoylenko
dblp:84/4565
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1981
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-authorTheory 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 › error-correcting codes › uniquely decodable codes
binoid codes |
0.0 | 1 | 1973 | Binoid error-correcting codes · IEEE Trans. Inf. Theory 1973 |
Coding theory
error-correcting codes |
0.0 | 1 | 1973 | Binoid error-correcting codes · IEEE Trans. Inf. Theory 1973 |
Coding theory › error-correcting codes
algebraic coding theory |
0.0 | 1 | 1973 | Binoid error-correcting codes · IEEE Trans. Inf. Theory 1973 |
Methods — techniques the papers use, named apart from their topics
algebraic synthesis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | Optimization Problems in Computer Network Design
Stanislav I. Samoylenko |
Comput. Networks | 1 |
| 1973 | Binoid error-correcting codesabstractThe purpose of this paper is to develop more general techniques for the synthesis of error-correcting codes that dispense with the requirement that coding elements and operations must be associated with finite fields. This approach permits an extension of the class of coded messages and coding operations and leads in certain cases to a reduction of implementation complexity. Stanislav I. Samoylenko |
IEEE Trans. Inf. Theory | 1 |