Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yuan Li 0047
dblp:86/6196-47
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0001-8979-1299ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 4 since 2021
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% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
boolean functions |
0.8 | 1 | 2024 | Monomial Boolean functions with large high-order nonlinearities · Inf. Comput. 2024 |
Cryptographic primitives and cryptanalysis › boolean functions
nonlinearity |
0.8 | 1 | 2024 | Monomial Boolean functions with large high-order nonlinearities · Inf. Comput. 2024 |
Coding theory
boolean functions |
0.7 | 1 | 2023 | The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20 · IEEE Trans. Inf. Theory 2023 |
Coding theory › error-correcting codes
covering radius |
0.7 | 1 | 2023 | The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20 · IEEE Trans. Inf. Theory 2023 |
Coding theory › boolean functions
nonlinearity |
0.7 | 1 | 2023 | The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20 · IEEE Trans. Inf. Theory 2023 |
Coding theory › error-correcting codes
reed-muller codes |
0.7 | 1 | 2023 | The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20 · IEEE Trans. Inf. Theory 2023 |
Methods — techniques the papers use, named apart from their topics
quotient space classification · 0.7affine transformation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Fast leader selection for opinion maximization in signed graphs
Xinna Zhou, Yuan Li 0047, Zhongzhi Zhang |
Theor. Comput. Sci. | 3 |
| 2024 | Monomial Boolean functions with large high-order nonlinearities
Jinjie Gao, Haibin Kan, Yuan Li 0047, Qichun Wang |
Inf. Comput. | 3 |
| 2023 | On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
Andrew Drucker, Yuan Li 0047 |
COCOON (2) | 2 |
| 2023 | The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20abstractWe prove the covering radius of the third-order Reed-Muller code$\mathrm {RM}(3,7)$is 20, which was previously known to be between 20 and 23 (inclusive). The covering radius of$\mathrm {RM}(3,7)$is the maximum third-order nonlinearity among all 7-variable Boolean functions. It was known that there exist 7-variable Boolean functions with third-order nonlinearity 20. We prove the third-order nonlinearity cannot achieve 21. According to the classification of the quotient space of$\mathrm {RM}(6,6)/\mathrm {RM}(3,6)$, we classify all 7-variable Boolean functions into 66 types. Firstly, we prove 62 types (among 66) cannot have third-order nonlinearity 21; Secondly, we prove that any function in the remaining 4 types can be transformed into a type (6, 10) function, if its third-order nonlinearity is 21; Finally, we transform type (6, 10) functions into a specific form, and prove the functions in that form cannot achieve the third-order nonlinearity 21 (with the assistance of computers). By the way, we prove that the affine transformation group over any finite field can be generated by two elements. Jinjie Gao, Haibin Kan, Yuan Li 0047, Qichun Wang |
IEEE Trans. Inf. Theory | 3 |