| Publication | Date of Publication | Type |
|---|
Lattice of definability in the order of rational numbers
Mathematical Notes | 2020-08-31 | Paper |
Algorithmic aspects of decomposition and equivalence of finite-valued transducers
Problems of Information Transmission | 2016-03-18 | Paper |
On joint conditional complexity (entropy)
Proceedings of the Steklov Institute of Mathematics | 2014-08-04 | Paper |
Kolmogorov complexity and cryptography
Proceedings of the Steklov Institute of Mathematics | 2014-08-04 | Paper |
Determinization of ordinal automata
Problems of Information Transmission | 2013-11-25 | Paper |
Limit complexities revisited
| 2013-03-19 | Paper |
Limit complexities revisited [once more]
| 2012-04-01 | Paper |
Stability of properties of Kolmogorov complexity under relativization
Problems of Information Transmission | 2011-01-25 | Paper |
Limit complexities revisited
Theory of Computing Systems | 2010-10-06 | Paper |
Sequences close to periodic
Russian Mathematical Surveys | 2010-04-08 | Paper |
Algorithmic randomness and splitting of supermartingales
Problems of Information Transmission | 2009-10-20 | Paper |
A Random Oracle Does Not Help Extract the Mutual Information
Lecture Notes in Computer Science | 2009-02-03 | Paper |
An improvement of Kolmogorov's estimates related to random number generators and a definition of randomness in terms of complexity
Doklady Mathematics | 2007-10-22 | Paper |
Non-reducible descriptions for conditional Kolmogorov complexity
Theoretical Computer Science | 2007-09-28 | Paper |
On semimeasures predicting Martin-Löf random sequences
Theoretical Computer Science | 2007-09-18 | Paper |
Shannon Entropy vs. Kolmogorov Complexity
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets
Annals of Pure and Applied Logic | 2006-08-16 | Paper |
Enumerations of the Kolmogorov function
Journal of Symbolic Logic | 2006-08-03 | Paper |
scientific article; zbMATH DE number 2206111 (Why is no real title available?)
| 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
On the role of the law of large numbers in the theory of randomness
Problems of Information Transmission | 2005-08-17 | Paper |
scientific article; zbMATH DE number 1995184 (Why is no real title available?)
| 2003-10-21 | Paper |
Almost periodic sequences.
Theoretical Computer Science | 2003-08-17 | Paper |
One application of real-valued interpretation of formal power series.
Theoretical Computer Science | 2003-08-17 | Paper |
The definable criterion for definability in Presburger arithmetic and its applications.
Theoretical Computer Science | 2003-08-17 | Paper |
Conditional complexity and codes
Theoretical Computer Science | 2002-03-03 | Paper |
Kolmogorov entropy in the context of computability theory
Theoretical Computer Science | 2002-03-03 | Paper |
Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
Theoretical Computer Science | 2002-03-03 | Paper |
A class of enumerable sets
Russian Mathematical Surveys | 2001-07-26 | Paper |
Mathematical metaphysics of randomness
Theoretical Computer Science | 1999-01-12 | Paper |
On common information
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1206053 (Why is no real title available?)
| 1998-11-09 | Paper |
A general method to construct oracles realizing given relationships between complexity classes
Theoretical Computer Science | 1997-02-27 | Paper |
Lower Limits of Frequencies in Computable Sequences and Relativized a Priori Probability
Theory of Probability & Its Applications | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3985203 (Why is no real title available?)
| 1985-01-01 | Paper |
