2009 |
18 | EE | Daniil Musatov,
Andrei E. Romashchenko,
Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem
CoRR abs/0904.3116: (2009) |
2008 |
17 | EE | Bruno Durand,
Andrei E. Romashchenko,
Alexander Shen:
Fixed Point and Aperiodic Tilings.
Developments in Language Theory 2008: 276-288 |
16 | | Laurent Bienvenu,
Andrei E. Romashchenko,
Alexander Shen:
Sparse sets.
JAC 2008: 18-28 |
15 | EE | Andrei A. Muchnik,
Andrei E. Romashchenko:
A Random Oracle Does Not Help Extract the Mutual Information.
MFCS 2008: 527-538 |
14 | EE | Bruno Durand,
Andrei E. Romashchenko,
Alexander Shen:
Fixed Point and Aperiodic Tilings
CoRR abs/0802.2432: (2008) |
13 | EE | Bruno Durand,
Alexander Shen,
Andrei E. Romashchenko:
Fixed Point and Aperiodic Tilings.
Electronic Colloquium on Computational Complexity (ECCC) 15(030): (2008) |
2006 |
12 | EE | Andrei E. Romashchenko:
Reliable Computations Based on Locally Decodable Codes.
STACS 2006: 537-548 |
2005 |
11 | EE | Troy Lee,
Andrei E. Romashchenko:
Resource bounded symmetry of information revisited.
Theor. Comput. Sci. 345(2-3): 386-405 (2005) |
2004 |
10 | EE | Troy Lee,
Andrei E. Romashchenko:
On Polynomially Time Bounded Symmetry of Information.
MFCS 2004: 463-475 |
9 | EE | Troy Lee,
Andrei E. Romashchenko:
On Polynomially Time Bounded Symmetry of Information
Electronic Colloquium on Computational Complexity (ECCC)(031): (2004) |
2003 |
8 | EE | Andrei E. Romashchenko:
Extracting the Mutual Information for a Triple of Binary Strings.
IEEE Conference on Computational Complexity 2003: 221-229 |
2002 |
7 | EE | Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Combinatorial interpretation of Kolmogorov complexity.
Theor. Comput. Sci. 271(1-2): 111-123 (2002) |
6 | EE | 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) |
2000 |
5 | EE | Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity.
IEEE Conference on Computational Complexity 2000: 131-137 |
4 | EE | Andrei E. Romashchenko,
Alexander Shen,
Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity
Electronic Colloquium on Computational Complexity (ECCC) 7(26): (2000) |
3 | | 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 |
2 | EE | 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- |
1997 |
1 | EE | 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 |