B.Durand, A.Romashchenko, A.Shen. Fixed-point tile sets and their applications. Journal of Computer and System Sciences. Volume 78, Issue 3, May 2012, pp. 731-764.
Electronic version: arXiv:0802.2432v3 (2009), http://arxiv.org/abs/0910.2415 Go to publication
D.Musatov, A.Romashchenko, A.Shen. Variations on Muchnik"s Conditional Complexity Theorem. Theory Comput. Syst. 49 (2). 2011, pp. 227-245.
Electronic version: arXiv:0904.3116v4, http://arxiv.org/abs/0904.3116 Go to publication
T.Kaced, A.Romashchenko. On essentially conditional information inequalities. Proc. IEEE International Symposium on Information Theory (ISIT). St. Petersburg, Russia, July 31 - August 5, 2011. pp. 1935-1939.
Electronic version: arXiv:1103.2545, http://arxiv.org/abs/1103.2545 Go to publication
A.Romashchenko. Pseudo-random graphs and bit probe schemes with one-sided error. In Proc. 6th International Computer Science Symposium in Russia (CSR). St. Petersburg, Russia, June 14-18, 2011. Lecture Notes in Computer Science, 6651. Springer. pp. 50-63.
Electronic version: arXiv:1102.5538, http://arxiv.org/abs/1102.5538 Go to publication
B. Durand, A. Romashchenko, A. Shen. Effective Closed Subshifts in 1D Can Be Implemented in 2D. Fields of Logic and Computation 2010, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 6300, 2010, pp. 208-226. Go to publication
Fixed point theorem and aperiodic tilings, Bulletin of the European Association for Theoretical Computer Science (EATCS), no. 97, pp. 126-136 (The Logic in Computer Science Column by Yuri Gurevich) Go to publication
High Complexity Tilings with Sparse Errors. In Proceedings: Automata, Languages and Programming, 36th International Colloquium, (ICALP), Rhodes, Greece, July 5-12, 2009. Part I. Lecture Notes in Computer Science 5555 Springer 2009, pp. 403-414. Download (164.6 KB)
Variations on Muchnik"s Conditional Complexity Theorem. Lecture Notes in Computer Science 5675: Proc. 4th International Computer Science Symposium in Russia (CSR). Novosibirsk, Russia, August 18-23, 2009. pp. 250-262. Electronic version: arXiv:0904.3116v2, http://arxiv.org/abs/0904.3116 Go to publication
Fixed Point and Aperiodic Tilings. Lecture Notes in Computer Science 5257 Springer: Proc. 12th international conference on Developments in Language Theory (DLT). Kyoto, Japan, September 2008, pp. 537-548. Electronic version: arXiv:0802.2432v3. Go to publication
A Random Oracle Does Not Help Extract the Mutual Information. Proc. 33rd International Symposium in Mathematical Foundations of Computer Science (MFCS). Torun, Poland, August 25-29, 2008. (Lecture Notes in Computer Science 5162 Springer 2008 pp. 527-538).
A.Romashchenko. Reliable Computations Based on Locally Decodable Codes. Lecture Notes in Computer Science 3884: Proc. 23rd International Symposium on Theoretical Aspects of Computer Science (STACS). Marseille, France, February 2006, pp. 537-548.
K.Makarychev, Yu.Makarychev, A.Romashchenko, N.Vereshchagin. A New Class of non-Shannon Type Inequalities for Entropies. Communications in Information and Systems. 2 (2002) No. 2, pp. 147-166. Go to publication
Muchnik An., Romashchenko A., Shen A., Vereshchagin N. Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y". Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 4-6 May 1999, Atlanta, Georgia, USA. IEEE Computer Society. 114-121.
Hammer D., Romashchenko A., Shen A., Vereshchagin N. Inequalities for Shannon entropies and Kolmogorov complexities. Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, June 24-27, 1997, Ulm, Germany. IEEE Computer Society Press. pp. 13-23