Andrej Muchnik

Andrei A. Muchnik

2009
29	EE	Andrei A. Muchnik, Yu. L. Pritykin, Alexei L. Semenov: Sequences close to periodic CoRR abs/0903.5316: (2009)
2008
28	EE	Andrei A. Muchnik, Andrei E. Romashchenko: A Random Oracle Does Not Help Extract the Mutual Information. MFCS 2008: 527-538
27	EE	Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin: Limit complexities revisited. STACS 2008: 73-84
26	EE	Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin: Limit complexities revisited CoRR abs/0802.2833: (2008)
25	EE	Andrej Muchnik, Alexey V. Chernov, Alexander Shen: Algorithmic randomness and splitting of supermartingales CoRR abs/0807.3156: (2008)
2007
24	EE	Marcus Hutter, Andrej Muchnik: On Semimeasures Predicting Martin-Loef Random Sequences CoRR abs/0708.2319: (2007)
23	EE	Marcus Hutter, Andrej Muchnik: On semimeasures predicting Martin-Löf random sequences. Theor. Comput. Sci. 382(3): 247-261 (2007)
22	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
21	EE	Andrei A. Muchnik, Nikolai K. Vereshchagin: Shannon Entropy vs. Kolmogorov Complexity. CSR 2006: 281-291
20	EE	Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin: Non-reducible Descriptions for Conditional Kolmogorov Complexity. TAMC 2006: 308-317
19	EE	Andrej Muchnik, Alexei L. Semenov: Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets. Ann. Pure Appl. Logic 141(3): 437-441 (2006)
2004
18	EE	Marcus Hutter, Andrej Muchnik: Universal Convergence of Semimeasures on Individual Random Sequences. ALT 2004: 234-248
17	EE	Bruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin: Ecological Turing Machines. ICALP 2004: 457-468
16	EE	Marcus Hutter, Andrej Muchnik: Universal Convergence of Semimeasures on Individual Random Sequences CoRR cs.LG/0407057: (2004)
15	EE	Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet: Enumerations of the Kolmogorov Function Electronic Colloquium on Computational Complexity (ECCC)(015): (2004)
14	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)
2003
13	EE	Andrei A. Muchnik, Alexei L. Semenov, Maxim Ushakov: Almost periodic sequences. Theor. Comput. Sci. 1-3(304): 1-33 (2003)
12		Andrei A. Muchnik: The definable criterion for definability in Presburger arithmetic and its applications. Theor. Comput. Sci. 290(3): 1433-1444 (2003)
11		Andrei A. Muchnik: One application of real-valued interpretation of formal power series. Theor. Comput. Sci. 290(3): 1931-1946 (2003)
2002
10	EE	Andrei A. Muchnik, Semen Ye. Positselsky: Kolmogorov entropy in the context of computability theory. Theor. Comput. Sci. 271(1-2): 15-35 (2002)
9	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)
8	EE	Andrei A. Muchnik: Conditional complexity and codes. Theor. Comput. Sci. 271(1-2): 97-109 (2002)
2001
7	EE	Andrei A. Muchnik, Nikolai K. Vereshchagin: Logical Operations and Kolmogorov Complexity II. IEEE Conference on Computational Complexity 2001: 256-265
6	EE	Andrei A. Muchnik, Nikolai K. Vereshchagin: Logical operations and Kolmogorov complexity. II Electronic Colloquium on Computational Complexity (ECCC)(089): (2001)
2000
5	EE	Andrei A. Muchnik, Alexei L. Semenov: Multi-conditional Descriptions and Codes in Kolmogorov Complexity Electronic Colloquium on Computational Complexity (ECCC) 7(15): (2000)
1999
4	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-
1998
3	EE	Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky: Mathematical Metaphysics of Randomness. Theor. Comput. Sci. 207(2): 263-317 (1998)
2	EE	Andrei A. Muchnik: On Common Information. Theor. Comput. Sci. 207(2): 319-328 (1998)
1996
1	EE	Andrei A. Muchnik, Nikolai K. Vereshchagin: A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes. Theor. Comput. Sci. 157(2): 227-258 (1996)

Coauthor Index

1	Richard Beigel	[15]
2	Laurent Bienvenu	[26] [27]
3	Harry Buhrman	[15]
4	Alexey V. Chernov	[9] [25]
5	Bruno Durand	[17]
6	Peter A. Fejer	[15]
7	Lance Fortnow	[15]
8	Piotr Grabowski	[15]
9	Marcus Hutter	[16] [18] [23] [24]
10	Luc Longpré	[15]
11	Semen Ye. Positselsky	[10]
12	Yu. L. Pritykin	[29]
13	Andrei E. Romashchenko	[4] [9] [28]
14	Alexei L. Semenov	[3] [5] [13] [19] [29]
15	Alexander Shen	[4] [9] [14] [20] [22] [25] [26] [27]
16	Frank Stephan	[15]
17	Leen Torenvliet	[15]
18	Maxim Ushakov	[13] [17]
19	Vladimir A. Uspensky	[3]
20	Mikhail Ustinov	[22]
21	Nikolay Veraschagin	[27]
22	Nikolai K. Vereshchagin	[1] [4] [6] [7] [9] [14] [17] [20] [21] [22] [26]
23	Michael V. Vyugin	[14] [20] [22]

Colors in the list of coauthors