| 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 | 250 | 2000 |
| 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 | 155 | 2002 |
| Fixed-point tile sets and their applications B Durand, A Romashchenko, A Shen Journal of Computer and System Sciences 3 (78), 731-764, 2012 | 96 | 2012 |
| Effective Closed Subshifts in 1D Can Be Implemented in 2D. B Durand, AE Romashchenko, A Shen Fields of logic and computation 6300, 208-226, 2010 | 60 | 2010 |
| 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 | 50 | 2002 |
| Fixed point and aperiodic tilings B Durand, A Romashchenko, A Shen International Conference on Developments in Language Theory, 276-288, 2008 | 39 | 2008 |
| Combinatorial interpretation of Kolmogorov complexity A Romashchenko, A Shen, N Vereshchagin Theoretical Computer Science 271 (1-2), 111-123, 2002 | 36 | 2002 |
| Variations on Muchnik’s conditional complexity theorem D Musatov, A Romashchenko, A Shen Theory of Computing Systems 49 (2), 227-245, 2011 | 29 | 2011 |
| 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 | 28 | 2020 |
| Conditional Information Inequalities for Entropic and Almost Entropic Points. T Kaced, A Romashchenko IEEE Transactions on Information Theory 59 (11), 7149-7167, 2013 | 28 | 2013 |
| Resource bounded symmetry of information revisited T Lee, A Romashchenko Theoretical Computer Science 345 (2-3), 386-405, 2005 | 24* | 2005 |
| Extracting the mutual information for a triple of binary strings A Romashchenko 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003 | 22* | 2003 |
| Pairs of Words with Nonmaterializable Mutual Information AE Romashchenko Problems of Information Transmission 36 (1), 2000 | 22 | 2000 |
| 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 | 19 | 2019 |
| Reliable computations based on locally decodable codes A Romashchenko Annual Symposium on Theoretical Aspects of Computer Science, 537-548, 2006 | 16 | 2006 |
| An operational characterization of mutual information in algorithmic information theory A Romashchenko, M Zimand Journal of the ACM (JACM) 66 (5), 38, 2019 | 13 | 2019 |
| Sparse sets. L Bienvenu, AE Romashchenko, A Shen JAC, 18-28, 2008 | 12* | 2008 |
| The axiomatic power of Kolmogorov complexity L Bienvenu, A Romashchenko, A Shen, A Taveneaux, S Vermeeren Annals of Pure and Applied Logic 165 (9), 1380-1402, 2014 | 11 | 2014 |
| A Conditional Information Inequality and its Combinatorial Applications T Kaced, A Romashchenko, N Vereshchagin IEEE Transactions on Information Theory 64 (5), 3610-3615, 2018 | 10 | 2018 |
| On essentially conditional information inequalities T Kaced, A Romashchenko 2011 IEEE International Symposium on Information Theory Proceedings, 1935-1939, 2011 | 9 | 2011 |
alexander shenDirecteur de recherche 2 cl., LIRMM, CNRS, University of Montpellier 2, Francelirmm.fr의 이메일 확인됨
