scientific article; zbMATH DE number 3497786
From MaRDI portal
Publication:4079503
zbMATH Open0317.94025MaRDI QIDQ4079503FDOQ4079503
Authors: Peter Gács, János Körner 
Publication date: 1973
Title of this publication is not available (Why is that?)
Cited In (31)
- 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
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
- Clustering with respect to the information distance
- Abelian sharing, common informations, and linear rank inequalities
- Secure non-interactive reduction and spectral analysis of correlations
- On ideal and weakly-ideal access structures
- Arbitrarily small amounts of correlation for arbitrarily varying quantum channels
- On common information
- Common Information, Noise Stability, and Their Extensions
- Common randomness and distributed control: A counterexample
- 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
- On the \(\Phi \)-stability and related conjectures
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
- Secure non-interactive reducibility is decidable
- Universal Features for High-Dimensional Learning and Inference
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)
