| Publication | Date of Publication | Type |
|---|
| A new simple family of non-periodic tilings with square tiles | 2023-07-30 | Paper |
| Information disclosure in the framework of Kolmogorov complexity | 2023-04-20 | Paper |
| Kolmogorov Last Discovery? (Kolmogorov and Algorithmic Statictics) | 2023-03-23 | Paper |
| How much randomness is needed to convert MA protocols to AM protocols? | 2022-11-11 | Paper |
| A family of non-periodic tilings of the plane by right golden triangles | 2022-06-03 | Paper |
| Information disclosure in the framework of Kolmogorov complexity | 2021-08-03 | Paper |
| High entropy random selection protocols | 2021-03-26 | Paper |
| Proofs of conservation inequalities for Levin's notion of mutual information of 1974 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111147 | 2020-05-26 | Paper |
| On the structure of Ammann A2 tilings | 2020-04-07 | Paper |
| Descriptive complexity of computable sequences revisited | 2020-01-29 | Paper |
| Sparse selfreducible sets and nonuniform lower bounds | 2019-01-11 | Paper |
| A Conditional Information Inequality and Its Combinatorial Applications | 2018-09-14 | Paper |
| Short lists with short programs in short time | 2018-04-18 | Paper |
| Short lists with short programs from programs of functions and strings | 2018-02-01 | Paper |
| Kolmogorov Complexity and Algorithmic Randomness | 2017-12-28 | Paper |
| Encoding invariance in average case complexity | 2017-11-07 | Paper |
| Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity | 2017-07-27 | Paper |
| Algorithmic Statistics: Forty Years Later | 2017-04-04 | Paper |
| Towards a reverse Newman's theorem in interactive information complexity | 2016-11-29 | Paper |
| Algorithmic minimal sufficient statistics: a new approach | 2016-05-19 | Paper |
| Algorithmic Statistics Revisited | 2016-05-13 | Paper |
| Short lists with short programs for functions | 2014-09-20 | Paper |
| Aperiodic Tilings by Right Triangles | 2014-08-07 | Paper |
| On joint conditional complexity (entropy) | 2014-08-04 | Paper |
| Randomized Communication Complexity of Approximating Kolmogorov Complexity | 2014-06-24 | Paper |
| On Algorithmic Strong Sufficient Statistics | 2013-08-05 | Paper |
| Improving on Gutfreund, Shaltiel,and Ta-Shma’s Paper “If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances” | 2013-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910709 | 2013-03-19 | Paper |
| Limit complexities revisited [once more] | 2012-04-01 | Paper |
| Test martingales, Bayes factors and \(p\)-values | 2011-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3020324 | 2011-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3020318 | 2011-08-03 | Paper |
| Insuring against loss of evidence in game-theoretic probability | 2011-01-14 | Paper |
| Limit complexities revisited | 2010-10-06 | Paper |
| Algorithmic Minimal Sufficient Statistic Revisited | 2010-07-28 | Paper |
| On abstract resource semantics and computability logic | 2010-07-08 | Paper |
| An Encoding Invariant Version of Polynomial Time Computable Distributions | 2010-06-22 | Paper |
| Kolmogorov complexity of enumerating finite sets | 2010-03-24 | Paper |
| Does the polynomial hierarchy collapse if onto functions are invertible? | 2010-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396628 | 2009-09-19 | Paper |
| Kolmogorov Complexity and Model Selection | 2009-08-18 | Paper |
| Kolmogorov-Loveland stochasticity for finite strings | 2009-07-21 | Paper |
| High Entropy Random Selection Protocols | 2009-02-17 | Paper |
| Kolmogorov's Structure Functions and Model Selection | 2008-12-21 | Paper |
| On-Line Probability, Complexity and Randomness | 2008-10-14 | Paper |
| On Game Semantics of the Affine and Intuitionistic Logics | 2008-07-10 | Paper |
| Inverting Onto Functions and Polynomial Hierarchy | 2008-06-03 | Paper |
| Kolmogorov Complexity with Error | 2008-03-19 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Non-reducible descriptions for conditional Kolmogorov complexity | 2007-09-28 | Paper |
| Individual communication complexity | 2007-08-23 | Paper |
| Shannon Entropy vs. Kolmogorov Complexity | 2007-05-02 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433902 | 2007-04-23 | Paper |
| Partitioning multi-dimensional sets in a small number of ``uniform parts | 2006-12-07 | Paper |
| A new class of non-Shannon-type inequalities for entropies | 2006-06-20 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4681892 | 2005-06-08 | Paper |
| How to use several noisy channels with unknown error probabilities | 2003-08-19 | Paper |
| Do stronger definitions of randomness exist? | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411816 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4798659 | 2003-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552275 | 2002-09-01 | Paper |
| Inequalities for Shannon entropy and Kolmogorov complexity | 2002-07-10 | Paper |
| Independent minimum length programs to translate between given strings | 2002-03-03 | Paper |
| Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\) | 2002-03-03 | Paper |
| Combinatorial interpretation of Kolmogorov complexity | 2002-03-03 | Paper |
| Logical operations and Kolmogorov complexity | 2002-03-03 | Paper |
| Kolmogorov complexity conditional to large integers | 2002-03-03 | Paper |
| Descriptive complexity of computable sequences | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757852 | 2001-12-04 | Paper |
| Arthur-Merlin games in Boolean decision trees | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4245751 | 1999-06-09 | Paper |
| Randomized Boolean decision trees: Several remarks | 1999-01-12 | Paper |
| Oracle separation of complexity classes and lower bounds for perceptrons solving separation problems | 1997-08-18 | Paper |
| A general method to construct oracles realizing given relationships between complexity classes | 1997-02-27 | Paper |
| RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS | 1994-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4306655 | 1994-09-21 | Paper |
| BANISHING ROBUST TURING COMPLETENESS | 1994-04-27 | Paper |
| New proof of the solvability of the elementary theory of linearly ordered sets | 1990-01-01 | Paper |
| Occurrence of zero in a linear recursive sequence | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3717120 | 1984-01-01 | Paper |
