EDBT 2026 Demo / reviewers in the wild / expert
Meir Smorodinsky
dblp:22/955
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1971
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 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 · 77% Information theory · 23% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
decodable codes |
0.0 | 1 | 1967 | On Infinite Decodable Codes · Inf. Control. 1967 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1971 | A Partition on a Bernoulli Shift which is not Weakly Bernoulli
Meir Smorodinsky |
Math. Syst. Theory | 1 |
| 1967 | On Infinite Decodable Codes
Meir Smorodinsky |
Inf. Control. | 1 |