 | 2009 |
| 41 |  | Daniil Musatov,
Andrei E. Romashchenko,
Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem.
CSR 2009: 250-262 |
| 40 |  | Bruno Durand,
Andrei E. Romashchenko,
Alexander Shen:
High Complexity Tilings with Sparse Errors.
ICALP (1) 2009: 403-414 |
| 39 |  | Alexander Shen:
Algorithmic Information Theory and Foundations of Probability.
RP 2009: 26-34 |
| 38 |  | Daniil Musatov,
Andrei E. Romashchenko,
Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem
CoRR abs/0904.3116: (2009) |
| 37 |  | Bruno Durand,
Andrei E. Romashchenko,
Alexander Shen:
Fixed-point tile sets and their applications
CoRR abs/0910.2415: (2009) |
| 2008 |
| 36 |  | Alexey V. Chernov,
Alexander Shen,
Nikolai K. Vereshchagin,
Vladimir Vovk:
On-Line Probability, Complexity and Randomness.
ALT 2008: 138-153 |
| 35 |  | Vladimir Vovk,
Alexander Shen:
Prequential Randomness.
ALT 2008: 154-168 |
| 34 |  | Bruno Durand,
Andrei E. Romashchenko,
Alexander Shen:
Fixed Point and Aperiodic Tilings.
Developments in Language Theory 2008: 276-288 |
| 33 |  | Laurent Bienvenu,
Andrei E. Romashchenko,
Alexander Shen:
Sparse sets.
JAC 2008: 18-28 |
| 32 |  | Laurent Bienvenu,
Andrej Muchnik,
Alexander Shen,
Nikolay Veraschagin:
Limit complexities revisited.
STACS 2008: 73-84 |
| 31 |  | Bruno Durand,
Andrei E. Romashchenko,
Alexander Shen:
Fixed Point and Aperiodic Tilings
CoRR abs/0802.2432: (2008) |
| 30 |  | Laurent Bienvenu,
Andrej Muchnik,
Alexander Shen,
Nikolai K. Vereshchagin:
Limit complexities revisited
CoRR abs/0802.2833: (2008) |
| 29 |  | Andrej Muchnik,
Alexey V. Chernov,
Alexander Shen:
Algorithmic randomness and splitting of supermartingales
CoRR abs/0807.3156: (2008) |
| 28 |  | Bruno Durand,
Alexander Shen,
Andrei E. Romashchenko:
Fixed Point and Aperiodic Tilings.
Electronic Colloquium on Computational Complexity (ECCC) 15(030): (2008) |
| 27 |  | Laurent Bienvenu,
Wolfgang Merkle,
Alexander Shen:
A Simple Proof of Miller-Yu Theorem.
Fundam. Inform. 83(1-2): 21-24 (2008) |
| 2007 |
| 26 |  | Noga Alon,
Ilan Newman,
Alexander Shen,
Gábor Tardos,
Nikolai K. Vereshchagin:
Partitioning multi-dimensional sets in a small number of "uniform" parts.
Eur. J. Comb. 28(1): 134-144 (2007) |
| 25 |  | Andrej Muchnik,
Alexander Shen,
Mikhail Ustinov,
Nikolai K. Vereshchagin,
Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity.
Theor. Comput. Sci. 384(1): 77-86 (2007) |
| 2006 |
| 24 |  | Alexander Shen:
Combinatorial proof of Muchnik's theorem.
Kolmogorov Complexity and Applications 2006 |
| 23 |  | Alexander Shen:
Multisource Algorithmic Information Theory.
Kolmogorov Complexity and Applications 2006 |
| 22 |  | Andrej Muchnik,
Alexander Shen,
Nikolai K. Vereshchagin,
Michael V. Vyugin:
Non-reducible Descriptions for Conditional Kolmogorov Complexity.
TAMC 2006: 308-317 |
| 21 |  | Alexander Shen:
Multisource Algorithmic Information Theory.
TAMC 2006: 327-338 |
| 20 |  | Alexander Shen:
Multisource algorithmic information theory
Electronic Colloquium on Computational Complexity (ECCC)(006): (2006) |
| 2005 |
| 19 |  | Noga Alon,
Ilan Newman,
Alexander Shen,
Gábor Tardos,
Nikolai K. Vereshchagin:
Partitioning multi-dimensional sets in a small number of ``uniform'' parts
Electronic Colloquium on Computational Complexity (ECCC)(095): (2005) |
| 2004 |
| 18 |  | Andrei A. Muchnik,
Alexander Shen,
Nikolai K. Vereshchagin,
Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity
Electronic Colloquium on Computational Complexity (ECCC)(054): (2004) |
| 2002 |
| 17 |  | Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Combinatorial interpretation of Kolmogorov complexity.
Theor. Comput. Sci. 271(1-2): 111-123 (2002) |
| 16 |  | Alexander Shen,
Nikolai K. Vereshchagin:
Logical operations and Kolmogorov complexity.
Theor. Comput. Sci. 271(1-2): 125-129 (2002) |
| 15 |  | Bruno Durand,
Alexander Shen,
Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences.
Theor. Comput. Sci. 271(1-2): 47-58 (2002) |
| 14 |  | Alexey V. Chernov,
Andrei A. Muchnik,
Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Upper semi-lattice of binary strings with the relation "x is simple conditional to y".
Theor. Comput. Sci. 271(1-2): 69-95 (2002) |
| 2001 |
| 13 |  | Bruno Durand,
Leonid A. Levin,
Alexander Shen:
Complex tilings.
STOC 2001: 732-739 |
| 12 |  | Bruno Durand,
Leonid A. Levin,
Alexander Shen:
Complex Tilings
CoRR cs.CC/0107008: (2001) |
| 11 |  | Bruno Durand,
Alexander Shen,
Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences
Electronic Colloquium on Computational Complexity (ECCC)(087): (2001) |
| 10 |  | Alexander Shen,
Nikolai K. Vereshchagin:
Logical operations and Kolmogorov complexity
Electronic Colloquium on Computational Complexity (ECCC)(088): (2001) |
| 2000 |
| 9 |  | Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity.
IEEE Conference on Computational Complexity 2000: 131-137 |
| 8 |  | Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity
Electronic Colloquium on Computational Complexity (ECCC) 7(26): (2000) |
| 7 |  | Daniel Hammer,
Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Inequalities for Shannon Entropy and Kolmogorov Complexity.
J. Comput. Syst. Sci. 60(2): 442-464 (2000) |
| 1999 |
| 6 |  | Andrei A. Muchnik,
Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y".
IEEE Conference on Computational Complexity 1999: 114- |
| 5 |  | Bruno Durand,
Alexander Shen,
Nikolai K. Vereshchagin:
Descriptive Complexity of Computable Sequences.
STACS 1999: 153-162 |
| 4 |  | Alexander Shen:
Discussion on Kolmogorov Complexity and Statistical Analysis.
Comput. J. 42(4): 340-342 (1999) |
| 1998 |
| 3 |  | Daniel Hammer,
Alexander Shen:
A Strange Application of Kolmogorov Complexity.
Theory Comput. Syst. 31(1): 1-4 (1998) |
| 1997 |
| 2 |  | Daniel Hammer,
Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Inequalities for Shannon entropies and Kolmogorov complexities.
IEEE Conference on Computational Complexity 1997: 13-23 |
| 1994 |
| 1 |  | Katalin Friedl,
Zsolt Hátsági,
Alexander Shen:
Low-degree Tests.
SODA 1994: 57-64 |