| Publication | Date of Publication | Type |
|---|
Algebraic barriers to halving algorithmic information quantities in correlated strings
Information and Computation | 2026-02-02 | Paper |
| Spectral approach to the communication complexity of multi-party key agreement | 2025-11-10 | Paper |
Communication complexity of the secret key agreement in algorithmic information theory
ACM Transactions on Computation Theory | 2025-02-25 | Paper |
Inequalities for space-bounded Kolmogorov complexity
Computability | 2023-01-12 | Paper |
Clustering with respect to the information distance
Theoretical Computer Science | 2022-08-25 | Paper |
scientific article; zbMATH DE number 7559415 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts
(available as arXiv preprint) | 2022-07-18 | Paper |
Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts
Journal of Computer and System Sciences | 2022-05-16 | Paper |
Clustering with Respect to the Information Distance
(available as arXiv preprint) | 2021-10-04 | Paper |
| An operational characterization of mutual information in algorithmic information theory | 2021-07-28 | Paper |
| Topological arguments for Kolmogorov complexity | 2021-04-27 | Paper |
The expressiveness of quasiperiodic and minimal shifts of finite type
Ergodic Theory and Dynamical Systems | 2021-03-03 | Paper |
ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES
Journal of Symbolic Logic | 2021-01-29 | Paper |
On the expressive power of quasiperiodic SFT
(available as arXiv preprint) | 2020-05-26 | Paper |
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
(available as arXiv preprint) | 2020-04-28 | Paper |
An operational characterization of mutual information in algorithmic information theory
Journal of the ACM | 2020-02-11 | Paper |
On the Combinatorial Version of the Slepian–Wolf Problem
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
A Conditional Information Inequality and Its Combinatorial Applications
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
| On OBDD-based algorithms and proof systems that dynamically change order of variables | 2018-04-19 | Paper |
Conditional Information Inequalities for Entropic and Almost Entropic Points
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Quasiperiodicity and non-computability in tilings
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Randomized polynomial time protocol for combinatorial Slepian-Wolf problem
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Topological arguments for Kolmogorov complexity
Theory of Computing Systems | 2015-07-20 | Paper |
Pseudo-random graphs and bit probe schemes with one-sided error
Theory of Computing Systems | 2015-02-05 | Paper |
The axiomatic power of Kolmogorov complexity
Annals of Pure and Applied Logic | 2014-06-06 | Paper |
Fixed-point tile sets and their applications
Journal of Computer and System Sciences | 2012-08-17 | Paper |
| On the Non-robustness of Essentially Conditional Information Inequalities | 2012-07-23 | Paper |
| Conditional and unconditional information inequalities: an algebraic example | 2012-01-30 | Paper |
Variations on Muchnik's conditional complexity theorem
Theory of Computing Systems | 2011-10-11 | Paper |
Pseudo-random graphs and bit probe schemes with one-sided error
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Stability of properties of Kolmogorov complexity under relativization
Problems of Information Transmission | 2011-01-25 | Paper |
Effective closed subshifts in 1D can be implemented in 2D
Fields of Logic and Computation | 2010-09-03 | Paper |
Variations on Muchnik's conditional complexity theorem
Lecture Notes in Computer Science | 2009-08-18 | Paper |
High Complexity Tilings with Sparse Errors
Automata, Languages and Programming | 2009-07-14 | Paper |
A Random Oracle Does Not Help Extract the Mutual Information
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Fixed Point and Aperiodic Tilings
Developments in Language Theory | 2008-10-30 | Paper |
Reliable Computations Based on Locally Decodable Codes
STACS 2006 | 2008-03-19 | Paper |
A new class of non-Shannon-type inequalities for entropies
Communications in Information and Systems | 2006-06-20 | Paper |
Resource bounded symmetry of information revisited
Theoretical Computer Science | 2005-12-06 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
A criterion for extractability of mutual information for a triple of strings
Problems of Information Transmission | 2005-08-17 | Paper |
Pairs of words with nonmaterializable mutual information
Problems of Information Transmission | 2003-11-20 | Paper |
Inequalities for Shannon entropy and Kolmogorov complexity
Journal of Computer and System Sciences | 2002-07-10 | Paper |
Sequences of binary strings with relation of conditional simplicity
Moscow University Mathematics Bulletin | 2002-04-14 | Paper |
Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)''
Theoretical Computer Science | 2002-03-03 | Paper |
Combinatorial interpretation of Kolmogorov complexity
Theoretical Computer Science | 2002-03-03 | Paper |
