Enter
Login:
Password:
Forgot your password?
scientific activity
structureeducational projectsperiodicalsstaffpress centercontacts
русский | english
Публикаций на странице:    Page: 1
2012 year
Authors: Romashchenko A., Kaced T.

Tarik Kaced, Andrei Romashchenko. Conditional Information Inequalities for Entropic and Almost Entropic Points. arXiv:1207.5742 (2012)
Go to publication

2012 year
Authors: Romashchenko A., Shen A., Durand B.

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

2011 year
Authors: Romashchenko A., Shen A., Musatov D.V.

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

2011 year
Authors: Romashchenko A., Kaced T.

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

2011 year
Authors: Romashchenko A.

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

2010 year
Authors: Romashchenko A., Muchnik An.A.

An.Muchnik, A.Romashchenko. Stability of properties of Kolmogorov complexity under relativization. Problems of information transmission. vol. 46, no. 1, 2010.
Go to publication

2010 year
Authors: Romashchenko A.

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

2009 year
Authors: Durand B., Romashchenko A., Shen A.

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

2009 year
Authors: Durand B., Romashchenko A., Shen A.

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)

2009 year
Authors: Musatov D., Romashchenko A., Shen A.

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

2008 year
Authors: Durand B., Romashchenko A., Shen A.

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

2008 year
Authors: Bienvenu L., Romashchenko A., Shen A.

Sparse sets. In Proc. First Symposium on Cellular Automata "Journees Automates Cellulaires" (JAC), Uzes, France, April 21-25, 2008, pp.18-28.
Download (193.9 KB)

2008 year
Authors: Muchnik An., Romashchenko A.

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).

2006 year
Authors: Romashchenko A.

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.

2005 year
Authors: B.Durand, Romashchenko A.

Bruno Durand and Andrei Romashchenko. On stability of computations by cellular automata. In Proc. Europeen conference on complex systems (ECCS), 2005 (P. Bourgine, editor).

2005 year
Authors: Lee T., Romashchenko A.

T.Lee and A.Romashchenko. Resource Bounded Symmetry of Information Revisited. Theoretical Computer Science. 345 (2005) No. 2-3, pp. 386-405.
Download (250.8 KB)

2003 year
Authors: Romashchenko A.

Extracting the Mutual Information for a Triple of Binary Strings. Proc. 18th Annual IEEE Conference on Computational Complexity (2003). Aarhus, Denmark, July 2003, pp. 221-235.
Download (250.7 KB)

2002 year
Authors: Chernov A., Muchnik An., Shen A., Romashchenko A., Vereshchagin N.

Upper semi-lattice of binary strings with the relation "x is simple conditional to y". Theoretical Computer Science. 271 (2002) pp. 69-95.
Download (299.9 KB)

2002 year
Authors: Romashchenko A., Shen A., Vereshchagin N.

A.Romashchenko, A.Shen, N.Vereshchagin. Combinatorial Interpretation of Kolmogorov Complexity. Theoretical Computer Science. 271 (2002) pp. 111-123.
Download (120.5 KB)

2002 year
Authors: Makarychev K., Makarychev Yu., Romashchenko A., Vereshchagin N.

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

2000 year
Authors: Romashchenko A.

A.E.Romashchenko. Pairs of Words with Nonmaterializable Mutual Information. Problems of Information Transmission. 36 (2000) No. 1, pp. 1-18.
Go to publication

2000 year
Authors: Hammer D., Romashchenko A., Shen A., Vereshchagin N.

D.Hammer, A.Romashchenko, A.Shen, N.Vereshchagin. Inequalities for Shannon Entropy and Kolmogorov Complexity. Journal of Computer and System Sciences. 60 (2000) pp. 442-464.
Go to publication

1999 year
Authors: Muchnik An., Romashchenko A., Shen A., Vereshchagin N.

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.

1997 year
Authors: Hammer D., Romashchenko A., Shen A., Vereshchagin N.

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

Публикаций на странице:    Page: 1
Search for publications of A. Romashchenko
Year of publication
from по
Author

Search phrase

Type of publication

Наличие в международных базах цитирования
Search in department

Date descending
Date ascending
 

 

  © Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), 2016
About  |  Contacts  |  The old version of this site