Andrei Romashchenko
Andrei Romashchenko
LIRMM, CNRS, University of Montpellier & IITP of Moscow
Dirección de correo verificada de lirmm.fr - Página principal
Título
Citado por
Citado por
Año
Inequalities for Shannon entropy and Kolmogorov complexity
D Hammer, A Romashchenko, A Shen, N Vereshchagin
Journal of Computer and System Sciences 60 (2), 442-464, 2000
2062000
A new class of non-Shannon-type inequalities for entropies
K Makarychev, Y Makarychev, A Romashchenko, N Vereshchagin
Communications in Information and Systems 2 (2), 147-166, 2002
1352002
Fixed-point tile sets and their applications
B Durand, A Romashchenko, A Shen
Journal of Computer and System Sciences 3 (78), 731-764, 2012
672012
Upper semi-lattice of binary strings with the relation “x is simple conditional to y”
A Chernov, A Muchnik, A Romashchenko, A Shen, N Vereshchagin
Theoretical Computer Science 271 (1-2), 69-95, 2002
46*2002
Effective closed subshifts in 1D can be implemented in 2D
B Durand, A Romashchenko, A Shen
Fields of logic and computation, 208-226, 2010
432010
Fixed point and aperiodic tilings
B Durand, A Romashchenko, A Shen
International Conference on Developments in Language Theory, 276-288, 2008
352008
Combinatorial interpretation of Kolmogorov complexity
A Romashchenko, A Shen, N Vereshchagin
Theoretical Computer Science 271 (1-2), 111-123, 2002
332002
Variations on Muchnik’s conditional complexity theorem
D Musatov, A Romashchenko, A Shen
Theory of Computing Systems 49 (2), 227-245, 2011
262011
Extracting the mutual information for a triple of binary strings
A Romashchenko
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003
19*2003
Pairs of Words with Nonmaterializable Mutual Information
AE Romashchenko
Problems of Information Transmission 36 (1), 2000
192000
Resource bounded symmetry of information revisited
T Lee, A Romashchenko
Theoretical Computer Science 345 (2-3), 386-405, 2005
18*2005
Conditional Information Inequalities for Entropic and Almost Entropic Points.
T Kaced, A Romashchenko
IEEE Transactions on Information Theory 59 (11), 7149-7167, 2013
172013
On obdd-based algorithms and proof systems that dynamically change order of variables
D Itsykson, A Knop, A Romashchenko, D Sokolov
The Journal of Symbolic Logic, 1-41, 2020
132020
Sparse sets.
L Bienvenu, AE Romashchenko, A Shen
JAC, 18-28, 2008
12*2008
Reliable computations based on locally decodable codes
A Romashchenko
Annual Symposium on Theoretical Aspects of Computer Science, 537-548, 2006
122006
How to use undiscovered information inequalities: Direct applications of the copy lemma
E Gürpınar, A Romashchenko
2019 IEEE International Symposium on Information Theory (ISIT), 1377-1381, 2019
92019
A Conditional Information Inequality and its Combinatorial Applications
T Kaced, A Romashchenko, N Vereshchagin
IEEE Transactions on Information Theory 64 (5), 3610-3615, 2018
92018
On essentially conditional information inequalities
T Kaced, A Romashchenko
2011 IEEE International Symposium on Information Theory Proceedings, 1935-1939, 2011
92011
On the expressive power of quasiperiodic SFT
B Durand, A Romashchenko
arXiv preprint arXiv:1705.01876, 2017
72017
Stability of properties of Kolmogorov complexity under relativization
AA Muchnik, AE Romashchenko
Problems of information transmission 46 (1), 38-61, 2010
72010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20