Andrej Muchnik

Konstantin Yu. Gorbunov

Probl. Inf. Transm., 2015

2013

Determinization of ordinal automata.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

2012

Limit complexities revisited [once more]

[BibT_eX]

[DOI]

Laurent Bienvenu

CoRR, 2012

2011

Kolmogorov complexity and cryptography

[BibT_eX]

[DOI]

CoRR, 2011

2010

Stability of properties of Kolmogorov complexity under relativization.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2010

Limit Complexities Revisited.

[BibT_eX]

[DOI]

Laurent Bienvenu

Theory Comput. Syst., 2010

Game interpretation of Kolmogorov complexity

[BibT_eX]

[DOI]

Ilya Mezhirov

CoRR, 2010

2009

Algorithmic randomness and splitting of supermartingales.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2009

Sequences close to periodic

[BibT_eX]

[DOI]

Yuri Pritykin

CoRR, 2009

2008

Algorithmic randomness and splitting of supermartingales

[BibT_eX]

[DOI]

Alexey V. Chernov

CoRR, 2008

Limit complexities revisited.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

A Random Oracle Does Not Help Extract the Mutual Information.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Non-reducible descriptions for conditional Kolmogorov complexity.

[BibT_eX]

[DOI]

Mikhail Ustinov

Michael V. Vyugin

Theor. Comput. Sci., 2007

On semimeasures predicting Martin-Löf random sequences.

[BibT_eX]

[DOI]

Marcus Hutter

Theor. Comput. Sci., 2007

On Semimeasures Predicting Martin-Loef Random Sequences

[BibT_eX]

[DOI]

Marcus Hutter

CoRR, 2007

2006

Enumerations of the Kolmogorov function.

[BibT_eX]

[DOI]

J. Symb. Log., 2006

Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2006

Shannon Entropy vs. Kolmogorov Complexity.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2006

2004

Non-reducible descriptions for conditional Kolmogorov complexity

[BibT_eX]

[DOI]

Michael V. Vyugin

Electron. Colloquium Comput. Complex., 2004

Ecological Turing Machines.

[BibT_eX]

[DOI]

Bruno Durand

Maxim Ushakov

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Universal Convergence of Semimeasures on Individual Random Sequences.

[BibT_eX]

[DOI]

Marcus Hutter

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

Almost periodic sequences.

[BibT_eX]

[DOI]

Maxim Ushakov

Theor. Comput. Sci., 2003

One application of real-valued interpretation of formal power series.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The definable criterion for definability in Presburger arithmetic and its applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On the Role of the Law of Large Numbers in the Theory of Randomness.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2003

2002

Kolmogorov entropy in the context of computability theory.

[BibT_eX]

[DOI]

Semen Ye. Positselsky

Theor. Comput. Sci., 2002

Conditional complexity and codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Upper semi-lattice of binary strings with the relation "x is simple conditional to y".

[BibT_eX]

[DOI]

Alexey V. Chernov

Theor. Comput. Sci., 2002

2001

Logical operations and Kolmogorov complexity. II

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

2000

Multi-conditional Descriptions and Codes in Kolmogorov Complexity

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

1999

Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y".

[BibT_eX]

[DOI]

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

Mathematical Metaphysics of Randomness.

[BibT_eX]

[DOI]

Vladimir A. Uspensky

Theor. Comput. Sci., 1998

On Common Information.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1996

A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes.

[BibT_eX]

[DOI]