Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Jinjun Zhou

dblp:54/1585 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › boolean functions
correlation immunity		 0.011999
Best Linear Approximation and Correlation Immunity of Functions Over Z*m · IEEE Trans. Inf. Theory 1999
Algorithms and data structures › signal processing algorithms
discrete fourier transform		 0.011999
Best Linear Approximation and Correlation Immunity of Functions Over Z*m · IEEE Trans. Inf. Theory 1999

Methods — techniques the papers use, named apart from their topics

primitive root of unity · 0.0discrete fourier transform · 0.0
YearPublicationVenuePosition
2025 Meta-guided dual path convolutional neural network for depression diagnosis with functional MR images
Jinjun Zhou, Si Zhou, Junneng Shao, Qing Lu 0005
 Neurocomputing1
1999 Best Linear Approximation and Correlation Immunity of Functions Over Z*m
abstract
A fast algorithm for the computation of the /spl rho/-representation of n-dimensional discrete Fourier transform (DFT) is given, where /spl rho/ is an mth primitive root of unity. Applying this algorithm to the standard /spl rho/-representation of the DFT of /spl rho//sup f(x)/, the best linear approximation of a function f(x) can be easily obtained when the codomain of f(x) is Z/sub m/. A spectral characterization of correlation-immune functions over Z, is also presented in terms of the DFT of /spl zeta//sup f(x)/.
Jinjun Zhou, Fengxiu Gao
 IEEE Trans. Inf. Theory1