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

F. Mat

dblp:42/3126 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

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

Theory 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.

Theoretical computer science
1 paper
Information theory · 50% Combinatorics and discrete mathematics · 50%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures › entropy
entropy functions		 0.112007
Two Constructions on Limits of Entropy Functions · IEEE Trans. Inf. Theory 2007
Combinatorics and discrete mathematics › matroid theory
polymatroids		 0.112007
Two Constructions on Limits of Entropy Functions · IEEE Trans. Inf. Theory 2007
Cryptographic protocols and secure computation › secret sharing › perfect secret sharing
ideal secret sharing schemes		 0.012007
Two Constructions on Limits of Entropy Functions · IEEE Trans. Inf. Theory 2007
Cryptographic protocols and secure computation
secret sharing		 0.012007
Two Constructions on Limits of Entropy Functions · IEEE Trans. Inf. Theory 2007

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

matroid theory · 0.1
YearPublicationVenuePosition
2007 Two Constructions on Limits of Entropy Functions
abstract
The correspondence between the subvectors of a random vector and their Shannon entropies gives rise to an entropy function. Limits of the entropy functions are closed to convolutions with modular polymatroids, and when integer-valued also to free expansions. The problem of description of the limits of entropy functions is reduced to those limits that correspond to matroids. Related results on entropy functions are reviewed with regard to polymatroid and matroid theories, and perfect and ideal secret sharing.
F. Mat
 IEEE Trans. Inf. Theory1