EDBT 2026 Demo / reviewers in the wild / expert
Mohammad A. Alhejji
dblp:248/7470
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0002-4250-3576ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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 · 61% Algorithmic game theory and mechanism design · 30% Mathematical optimization · 9% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › information measures
entropy |
0.4 | 1 | 2020 | Monotonicity Under Local Operations: Linear Entropic Formulas · IEEE Trans. Inf. Theory 2020 |
Algorithmic game theory and mechanism design › social choice
monotonicity |
0.4 | 1 | 2020 | Monotonicity Under Local Operations: Linear Entropic Formulas · IEEE Trans. Inf. Theory 2020 |
Mathematical optimization
polyhedral cone |
0.1 | 1 | 2020 | Monotonicity Under Local Operations: Linear Entropic Formulas · IEEE Trans. Inf. Theory 2020 |
Methods — techniques the papers use, named apart from their topics
von neumann entropy · 0.4convex geometry · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | A Tight Uniform Continuity Bound for EquivocationabstractWe prove a tight uniform continuity bound for the conditional Shannon entropy of discrete finitely supported random variables in terms of total variation distance. Mohammad A. Alhejji, Graeme Smith 0002 |
ISIT | 1 |
| 2020 | Monotonicity Under Local Operations: Linear Entropic FormulasabstractAll correlation measures, classical and quantum, must be monotonic under local operations. In this paper, we characterize monotonic formulas that are linear combinations of the von Neumann entropies associated with the quantum state of a physical system that has n parts. We show that these formulas form a polyhedral convex cone, which we call the monotonicity cone, and enumerate its facets. We illustrate its structure and prove that it is equivalent to the cone of monotonic formulas implied by strong subadditivity. We explicitly compute its extremal rays for n ≤ 5. We also consider the symmetric monotonicity cone, in which the formulas are required to be invariant under subsystem permutations. We describe this cone fully for all n. Mohammad A. Alhejji, Graeme Smith 0002 |
IEEE Trans. Inf. Theory | 1 |