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 EDBT 2026 / reviewers in the wild / expert

J. Meng

dblp:81/6584 · DBLP profile ↗
← Back
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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography › lattice problems
closest vector problem		 0.112006
The Hardness of the Closest Vector Problem With Preprocessing Over ellinfty Norm · IEEE Trans. Inf. Theory 2006
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
lattice problems		 0.112006
The Hardness of the Closest Vector Problem With Preprocessing Over ellinfty Norm · IEEE Trans. Inf. Theory 2006

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

reduction · 0.1subset-sum · 0.1subset sum · 0.1
YearPublicationVenuePosition
2006 The Hardness of the Closest Vector Problem With Preprocessing Over ellinfty Norm
abstract
We show that the closest vector problem with preprocessing (CVPP) over$ell_infty$norm$(hboxCVPP_infty)$is NP-hard. The result is obtained by the reduction from the subset sum problem with preprocessing to$hbox CVPP_infty$. The reduction also shows the NP-hardness of$hbox CVP_infty$, which is much simpler than all previously known proofs. In addition, we also give a direct reduction from exact 3-sets cover problem to$hbox CVPP_infty$.
J. Meng
 IEEE Trans. Inf. Theory2