Demo Data from EDBT 2026 / reviewers in the wild / expert
Shao Pu Zhang
dblp:74/5138
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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 |
Combinatorics and discrete mathematics · 100% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Combinatorics and discrete mathematics › combinatorial design › difference sets
almost difference set |
0.1 | 1 | 2006 | A new family of almost difference sets and some necessary conditions · IEEE Trans. Inf. Theory 2006 |
Combinatorics and discrete mathematics › combinatorial design
difference sets |
0.1 | 1 | 2006 | A new family of almost difference sets and some necessary conditions · IEEE Trans. Inf. Theory 2006 |
Methods — techniques the papers use, named apart from their topics
existence conditions · 0.1combinatorial construction · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | A new family of almost difference sets and some necessary conditionsabstractAlmost difference sets have important applications in cryptography and coding theory. In this paper, new families of almost difference sets are constructed. Some necessary conditions for the existence of (v,k,/spl lambda/,t)-almost difference sets in Z/sub v/ are derived. Jianguo Lei, Shao Pu Zhang |
IEEE Trans. Inf. Theory | 3 |