EDBT 2026 Demo / reviewers in the wild / expert
Josh Cadney
dblp:83/9888 · also Joshua Cadney
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2012
—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 · 72% Quantum computing and quantum information · 28% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › information measures › information inequalities
constrained information inequalities |
0.1 | 1 | 2012 | Infinitely Many Constrained Inequalities for the von Neumann Entropy · IEEE Trans. Inf. Theory 2012 |
Quantum computing and quantum information › quantum information theory
quantum entropy |
0.1 | 1 | 2012 | Infinitely Many Constrained Inequalities for the von Neumann Entropy · IEEE Trans. Inf. Theory 2012 |
Information theory › information measures › entropy
von neumann entropy |
0.1 | 1 | 2012 | Infinitely Many Constrained Inequalities for the von Neumann Entropy · IEEE Trans. Inf. Theory 2012 |
Information theory › information measures › entropy
entropy inequalities |
0.0 | 1 | 2012 | Infinitely Many Constrained Inequalities for the von Neumann Entropy · IEEE Trans. Inf. Theory 2012 |
Information theory › information measures › entropy
shannon entropy |
0.0 | 1 | 2012 | Infinitely Many Constrained Inequalities for the von Neumann Entropy · IEEE Trans. Inf. Theory 2012 |
Methods — techniques the papers use, named apart from their topics
probability distribution properties · 0.1independence proofs · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Infinitely Many Constrained Inequalities for the von Neumann EntropyabstractWe exhibit infinitely many new, constrained inequalities for the von Neumann entropy, and show that they are independent of each other and the known inequalities obeyed by the von Neumann entropy (basically strong subadditivity). The new inequalities were proved originally by Makarychevfor the Shannon entropy, using properties of probability distributions. Our approach extends the proof of the inequalities to the quantum domain, and includes their independence for the quantum and also the classical cases. Josh Cadney, Noah Linden, Andreas J. Winter 0002 |
IEEE Trans. Inf. Theory | 1 |