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

Shaocheng Liu

dblp:347/2074 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2026
0009-0003-3096-4089ORCID · corroborated

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

Theory of computation · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 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
2 papers
Information theory · 67% Combinatorics and discrete mathematics · 33%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures › entropy › entropy functions
entropy function characterization		 2.022026
Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four - Part II: Information Theoretic Constraints Breed New Combinatorial Structures · IEEE Trans. Inf. Theory 2026
Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four - Part I: Problem Formulation and More · IEEE Trans. Inf. Theory 2026
Combinatorics and discrete mathematics
combinatorial design		 1.012026
Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four - Part II: Information Theoretic Constraints Breed New Combinatorial Structures · IEEE Trans. Inf. Theory 2026

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

linear programming · 1.0combinatorial enumeration · 1.0combinatorial design theory · 1.0
YearPublicationVenuePosition
2026 Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four - Part I: Problem Formulation and More
abstract
Characterization of entropy functions is of fundamental importance in information theory. By imposing constraints on their Shannon outer bound, i.e., the polymatroidal region, one obtains the faces of the region and entropy functions on them with special structures. In this series of two papers, we characterize entropy functions on the 2-dimensional faces of the polymatroidal region of degree 4. In Part I, we formulate the problem, enumerate all 59 types of 2-dimensional faces of the region by an algorithm, and fully characterize entropy functions on 49 types of them. The entropy functions on the remaining 10 types of faces will be characterized in Part II, among which 8 types are fully characterized, and 2 types are partially characterized.
Shaocheng Liu, Qi Chen 0001
 IEEE Trans. Inf. Theory1
2026 Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four - Part II: Information Theoretic Constraints Breed New Combinatorial Structures
abstract
The characterization of entropy functions is of fundamental importance in information theory. By imposing constraints on their Shannon outer bound, i.e., the polymatroidal region, one obtains the faces of the region and entropy functions on them with special structures. In this series of two papers, we characterize entropy functions on the 2-dimensional faces of the polymatroidal region Γ4. In Part I, we formulated the problem, enumerated all 59 types of 2-dimensional faces of Γ4by an algorithm, and fully characterized entropy functions on 49 types of them. In this paper, i.e., Part II, we will characterize entropy functions on the remaining 10 types of faces, among which 8 types are fully characterized, and 2 types are partially characterized. To characterize these types of faces, we introduce some new combinatorial design structures that are interesting in themselves.
Shaocheng Liu, Qi Chen 0001, Minquan Cheng
 IEEE Trans. Inf. Theory1
2024 Symmetric Entropy Regions of Degrees Six and Seven
abstract
In this paper, we classify all G-symmetric almost entropic regions according to their Shannon-tightness, that is, whether they can be fully characterized by Shannon-type inequalities, where$G$is a permutation group of degree 6 or 7.
Shaocheng Liu, Qi Chen 0001
 ISIT2
2023 Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four
abstract
In this paper, we characterize entropy functions on the 2-dimensional faces of the polymatroidal region Γ4. We enumerate all 59 types of 2-dimensional faces of Γ4and fully characterized entropy functions on 27 types of them, among which 4 types are non-trivial.
Shaocheng Liu, Qi Chen 0001
 ISIT1