Alexander Shen

2008
29	EE	Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin: Limit complexities revisited. STACS 2008: 73-84
28	EE	Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed Point and Aperiodic Tilings CoRR abs/0802.2432: (2008)
27	EE	Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin: Limit complexities revisited CoRR abs/0802.2833: (2008)
2007
26	EE	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	EE	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	EE	Alexander Shen: Combinatorial proof of Muchnik's theorem. Kolmogorov Complexity and Applications 2006
23	EE	Alexander Shen: Multisource Algorithmic Information Theory. Kolmogorov Complexity and Applications 2006
22	EE	Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin: Non-reducible Descriptions for Conditional Kolmogorov Complexity. TAMC 2006: 308-317
21	EE	Alexander Shen: Multisource Algorithmic Information Theory. TAMC 2006: 327-338
20	EE	Alexander Shen: Multisource algorithmic information theory Electronic Colloquium on Computational Complexity (ECCC)(006): (2006)
2005
19	EE	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	EE	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	EE	Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin: Combinatorial interpretation of Kolmogorov complexity. Theor. Comput. Sci. 271(1-2): 111-123 (2002)
16	EE	Alexander Shen, Nikolai K. Vereshchagin: Logical operations and Kolmogorov complexity. Theor. Comput. Sci. 271(1-2): 125-129 (2002)
15	EE	Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin: Descriptive complexity of computable sequences. Theor. Comput. Sci. 271(1-2): 47-58 (2002)
14	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)
2001
13	EE	Bruno Durand, Leonid A. Levin, Alexander Shen: Complex tilings. STOC 2001: 732-739
12	EE	Bruno Durand, Leonid A. Levin, Alexander Shen: Complex Tilings CoRR cs.CC/0107008: (2001)
11	EE	Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin: Descriptive complexity of computable sequences Electronic Colloquium on Computational Complexity (ECCC)(087): (2001)
10	EE	Alexander Shen, Nikolai K. Vereshchagin: Logical operations and Kolmogorov complexity Electronic Colloquium on Computational Complexity (ECCC)(088): (2001)
2000
9	EE	Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin: Combinatorial Interpretation of Kolmogorov Complexity. IEEE Conference on Computational Complexity 2000: 131-137
8	EE	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	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-
5	EE	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	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
1994
1		Katalin Friedl, Zsolt Hátsági, Alexander Shen: Low-degree Tests. SODA 1994: 57-64

Coauthor Index

1	Noga Alon	[19] [26]
2	Laurent Bienvenu	[27] [29]
3	Alexey V. Chernov	[14]
4	Bruno Durand	[5] [11] [12] [13] [15] [28]
5	Katalin Friedl	[1]
6	Daniel Hammer	[2] [3] [7]
7	Zsolt Hátsági	[1]
8	Leonid A. Levin	[12] [13]
9	Andrei A. Muchnik	[6] [14] [18]
10	Andrej Muchnik	[22] [25] [27] [29]
11	Ilan Newman	[19] [26]
12	Andrei E. Romashchenko	[2] [6] [7] [8] [9] [14] [17] [28]
13	Gábor Tardos	[19] [26]
14	Mikhail Ustinov	[25]
15	Nikolay Veraschagin	[29]
16	Nikolai K. Vereshchagin	[2] [5] [6] [7] [8] [9] [10] [11] [14] [15] [16] [17] [18] [19] [22] [25] [26] [27]
17	Michael V. Vyugin	[18] [22] [25]

Colors in the list of coauthors