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

Li-Ping Wang 0001

dblp:78/5280-1 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2012
—ORCID · none

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

Security and privacy · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 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.

Theoretical computer science
1 paper
Coding theory · 50% Information theory · 50%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences
linear complexity		 0.112012
Improved results on the probabilistic theory of the joint linear complexity of multisequences · Sci. China Inf. Sci. 2012

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

probabilistic theory · 0.1
YearPublicationVenuePosition
2012 Improved results on the probabilistic theory of the joint linear complexity of multisequences
Harald Niederreiter, Michael Vielhaber 0001, Li-Ping Wang 0001
 Sci. China Inf. Sci.3
2012 On explicit factors of cyclotomic polynomials over finite fields
Li-Ping Wang 0001, Qiang Wang 0012
 Des. Codes Cryptogr.1
2009 An algorithm for computing bidirectional minimal polynomials for multisequences
abstract
In this paper we give an algorithm for computing a bidirectional minimal polynomial (a characteristic polynomial with not only minimal degree but also a nonzero constant term) of a given finite-length multisequence by modifying a lattice-based linear feedback shift register synthesis algorithm for multisequences. We also describe the set of all such polynomials for a multisequence.
Li-Ping Wang 0001
 ISIT1
2008 A Lattice-Based Minimal Partial Realization Algorithm
Li-Ping Wang 0001
 SETA1
2008 Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
Li-Ping Wang 0001, Harald Niederreiter
 J. Complex.1