scientific article; zbMATH DE number 3497786

Cited in

(31)

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

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)