scientific article; zbMATH DE number 7559415

DOI10.4230/LIPIcs.MFCS.2020.44MaRDI QIDQ5089211

Emirhan Gürpınar, Andrei Romashchenko

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2004.13411

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

mutual informationfinite geometryKolmogorov complexitycommunication complexityexpander mixing lemma

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields
• Pairs of words with nonmaterializable mutual information
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• Finite analogues of Euclidean space
• Spectral properties of unitary Cayley graphs of finite commutative rings
• Mixing Properties and the Chromatic Number of Ramanujan Complexes
• Expander graphs and their applications
• Secret key agreement by public discussion from common information
• Common randomness in information theory and cryptography. I. Secret sharing
• Secret Key Generation With Limited Interaction
• Kolmogorov Complexity and Algorithmic Randomness
• Communication Complexity
• Communication for Generating Correlation: A Unifying Survey
• An Operational Characterization of Mutual Information in Algorithmic Information Theory
• Common Information and Secret Key Capacity
• A Conditional Information Inequality and Its Combinatorial Applications
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• An introduction to Kolmogorov complexity and its applications
• Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
• Conditional complexity and codes

This page was built for publication: