VLDB 2026 Research / reviewers in the wild / expert
Daniel Sandberg
dblp:64/213
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1999
—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 |
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 › cryptographic function
APN functions |
0.0 | 1 | 1999 | New Families of Almost Perfect Nonlinear Power Mappings · IEEE Trans. Inf. Theory 1999 |
Coding theory
cryptographic function |
0.0 | 1 | 1999 | New Families of Almost Perfect Nonlinear Power Mappings · IEEE Trans. Inf. Theory 1999 |
Coding theory › boolean functions
differential uniformity |
0.0 | 1 | 1999 | New Families of Almost Perfect Nonlinear Power Mappings · IEEE Trans. Inf. Theory 1999 |
Coding theory › finite fields
power mapping |
0.0 | 1 | 1999 | New Families of Almost Perfect Nonlinear Power Mappings · IEEE Trans. Inf. Theory 1999 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | New Families of Almost Perfect Nonlinear Power MappingsabstractA power mapping f(x)=x/sup d/ over GF(p/sup n/) is said to be differentially k-uniform if k is the maximum number of solutions x/spl isin/GF(p/sup n/) of f(x+a)-f(x)=b where a, b/spl isin/GF(p/sup n/) and a/spl ne/0. A 2-uniform mapping is called almost perfect nonlinear (APN). We construct several new infinite families of nonbinary APN power mappings. Tor Helleseth, Chunming Rong, Daniel Sandberg |
IEEE Trans. Inf. Theory | 3 |