Demo Data from SIGIR 2026 / reviewers in the wild / expert
Narao Nakatsu
dblp:73/5799
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1991
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 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% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › source coding › variable-length codes › prefix codes
alphabetic codes |
0.0 | 1 | 1991 | Bounds on the redundancy of binary alphabetical codes · IEEE Trans. Inf. Theory 1991 |
Coding theory › source coding › universal coding
redundancy bounds |
0.0 | 1 | 1991 | Bounds on the redundancy of binary alphabetical codes · IEEE Trans. Inf. Theory 1991 |
Coding theory
source coding |
0.0 | 1 | 1991 | Bounds on the redundancy of binary alphabetical codes · IEEE Trans. Inf. Theory 1991 |
Coding theory › source coding › variable-length codes › prefix codes
huffman coding |
0.0 | 1 | 1991 | Bounds on the redundancy of binary alphabetical codes · IEEE Trans. Inf. Theory 1991 |
Methods — techniques the papers use, named apart from their topics
combinatorial bounds · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | Bounds on the redundancy of binary alphabetical codesabstractAn alphabetical code is a code in which the numerical binary order of the codewords corresponds to the alphabetical order of the encoded symbols. A necessary and sufficient condition for the existence of a binary alphabetical code is presented. The redundancy of the optimum binary alphabetical code is given in comparison with the Huffman code and its upper bound, which is tighter than bounds previously reported, is presented. The redundancy of the optimal alphabetical code is about 5% in comparison with the Huffman coding, which shows the usefulness of the alphabetical code.> Narao Nakatsu |
IEEE Trans. Inf. Theory | 1 |
| 1982 | A Longest Common Subsequence Algorithm Suitable for Similar Text Strings
Narao Nakatsu, Yahiko Kambayashi, Shuzo Yajima |
Acta Informatica | 1 |
| 1979 | Hierarchical string pattern matching using dynamic pattern matching machines
Yahiko Kambayashi, Narao Nakatsu, Shuzo Yajima |
COMPSAC | 2 |