scientific article; zbMATH DE number 3497786

Cited in

(31)

The classical-quantum multiple access channel with conferencing encoders and with common messages
An operational characterization of mutual information in algorithmic information theory
Dimension Reduction for Polynomials over Gaussian Space and Applications
One-message secure reductions: on the cost of converting correlations
Stability of properties of Kolmogorov complexity under relativization
Common Information, Noise Stability, and Their Extensions
Continuity and additivity properties of information decompositions
Arbitrarily small amounts of correlation for arbitrarily varying quantum channels
Inequalities for Shannon entropy and Kolmogorov complexity
Distributions attaining secret key at a rate of the conditional mutual information
Secure non-interactive simulation: feasibility and rate
Secure non-interactive reducibility is decidable
Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
Improving the linear programming technique in the search for lower bounds in secret sharing
Kolmogorov complexity as a language
Common randomness and distributed control: A counterexample
On the \(\Phi \)-stability and related conjectures
Common information, matroid representation, and secret sharing for matroid ports
On ideal and weakly-ideal access structures
Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
On common information
Multiple-user communication
On a connection between information and group lattices
Nonlocal Games with Noisy Maximally Entangled States are Decidable
Universal Features for High-Dimensional Learning and Inference
Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács
Secure non-interactive simulation from arbitrary joint distributions
Clustering with respect to the information distance
Abelian sharing, common informations, and linear rank inequalities
Secure non-interactive reduction and spectral analysis of correlations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079503)