Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAndrei E. Romashchenko
Person information
- affiliation: LIRMM, CNRS, University of Montpellier, France
- affiliation: IITP of Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – today
- 2019
[j16]Andrei E. Romashchenko, Marius Zimand:
An Operational Characterization of Mutual Information in Algorithmic Information Theory. J. ACM 66(5): 38:1-38:42 (2019)- [c25]Emirhan Gürpinar, Andrei E. Romashchenko:
How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. ISIT 2019: 1377-1381 - [c24]Julien Destombes, Andrei E. Romashchenko
:
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. STACS 2019: 23:1-23:17 - [i27]Emirhan Gürpinar, Andrei E. Romashchenko:
How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. CoRR abs/1901.07476 (2019) - [i26]Andrei E. Romashchenko, Marius Zimand:
On a conditional inequality in Kolmogorov complexity and its applications in communication complexity. CoRR abs/1905.00164 (2019) - [i25]Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-based algorithms and proof systems that dynamically change order of variables. Electronic Colloquium on Computational Complexity (ECCC) 26: 1 (2019) - 2018
- [b1]Andrei E. Romashchenko:
Algorithmic Measures of Information for Tuples of Words and for Patterns in Multidimensional Shifts of Finite Type. University of Montpellier, France, 2018 - [j15]Tarik Kaced, Andrei E. Romashchenko, Nikolai K. Vereshchagin:
A Conditional Information Inequality and Its Combinatorial Applications. IEEE Trans. Information Theory 64(5): 3610-3615 (2018) - [j14]Daniyar Chumbalov, Andrei E. Romashchenko:
On the Combinatorial Version of the Slepian-Wolf Problem. IEEE Trans. Information Theory 64(9): 6054-6069 (2018) - [c23]Andrei E. Romashchenko, Marius Zimand:
An Operational Characterization of Mutual Information in Algorithmic Information Theory. ICALP 2018: 95:1-95:14 - [i24]Bruno Durand, Andrei E. Romashchenko:
The expressiveness of quasiperiodic and minimal shifts of finite type. CoRR abs/1802.01461 (2018) - [i23]Julien Destombes, Andrei E. Romashchenko:
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. CoRR abs/1805.03929 (2018) - [i22]Andrei E. Romashchenko, Marius Zimand:
An operational characterization of mutual information in algorithmic information theory. Electronic Colloquium on Computational Complexity (ECCC) 25: 43 (2018) - 2017
- [c22]Bruno Durand, Andrei E. Romashchenko:
On the Expressive Power of Quasiperiodic SFT. MFCS 2017: 5:1-5:14 - [c21]Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. STACS 2017: 43:1-43:14 - [i21]Bruno Durand, Andrei E. Romashchenko:
On the expressive power of quasiperiodic SFT. CoRR abs/1705.01876 (2017) - [i20]Andrei E. Romashchenko, Marius Zimand:
An operational characterization of mutual information in algorithmic information theory. CoRR abs/1710.05984 (2017) - 2016
- [i19]Andrei E. Romashchenko:
Coding in the fork network in the framework of Kolmogorov complexity. CoRR abs/1602.02648 (2016) - 2015
- [j13]Andrei E. Romashchenko, Alexander Shen:
Topological Arguments for Kolmogorov Complexity. Theory Comput. Syst. 56(3): 513-526 (2015) - [c20]Bruno Durand, Andrei E. Romashchenko:
Quasiperiodicity and Non-computability in Tilings. MFCS (1) 2015: 218-230 - [c19]Daniyar Chumbalov, Andrei E. Romashchenko:
Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem. MFCS (2) 2015: 235-247 - [i18]Tarik Kaced, Andrei E. Romashchenko, Nikolay K. Vereshchagin:
Conditional Information Inequalities and Combinatorial Applications. CoRR abs/1501.04867 (2015) - [i17]Bruno Durand, Andrei E. Romashchenko:
Quasiperiodicity and non-computability in tilings. CoRR abs/1504.06130 (2015) - [i16]Daniyar Chumbalov, Andrei E. Romashchenko:
On the Combinatorial Version of the Slepian-Wolf Problem. CoRR abs/1511.02899 (2015) - 2014
- [j12]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren:
The axiomatic power of Kolmogorov complexity. Ann. Pure Appl. Logic 165(9): 1380-1402 (2014) - [j11]Andrei E. Romashchenko:
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error. Theory Comput. Syst. 55(2): 313-329 (2014) - 2013
- [j10]Tarik Kaced, Andrei E. Romashchenko:
Conditional Information Inequalities for Entropic and Almost Entropic Points. IEEE Trans. Information Theory 59(11): 7149-7167 (2013) - [i15]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren:
The axiomatic power of Kolmogorov complexity. CoRR abs/1301.3392 (2013) - 2012
- [j9]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78(3): 731-764 (2012) - [c18]Tarik Kaced, Andrei E. Romashchenko:
On the non-robustness of essentially conditional information inequalities. ITW 2012: 262-266 - [c17]Alexander Shen, Andrei E. Romashchenko:
Topological arguments for Kolmogorov complexity. AUTOMATA & JAC 2012: 127-132 - [i14]Tarik Kaced, Andrei E. Romashchenko:
Conditional and unconditional information inequalities: an algebraic example. CoRR abs/1201.6398 (2012) - [i13]Tarik Kaced, Andrei E. Romashchenko:
On the Non-robustness of Essentially Conditional Information Inequalities. CoRR abs/1207.5458 (2012) - [i12]Tarik Kaced, Andrei E. Romashchenko:
Conditional Information Inequalities for Entropic and Almost Entropic Points. CoRR abs/1207.5742 (2012) - 2011
- [j8]Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. Theory Comput. Syst. 49(2): 227-245 (2011) - [c16]Andrei E. Romashchenko:
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error. CSR 2011: 50-63 - [c15]Tarik Kaced, Andrei E. Romashchenko:
On essentially conditional information inequalities. ISIT 2011: 1935-1939 - [i11]Andrei E. Romashchenko:
Pseudo-random graphs and bit probe schemes with one-sided error. CoRR abs/1102.5538 (2011) - [i10]Tarik Kaced, Andrei E. Romashchenko:
Constraint information inequalities revisited. CoRR abs/1103.2545 (2011) - 2010
- [j7]Andrei A. Muchnik, Andrei E. Romashchenko:
Stability of properties of Kolmogorov complexity under relativization. Probl. Inf. Transm. 46(1): 38-61 (2010) - [c14]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Effective Closed Subshifts in 1D Can Be Implemented in 2D. Fields of Logic and Computation 2010: 208-226 - [c13]Andrei E. Romashchenko:
Fixed Point Argument and Tilings without Long Range Order. FICS 2010: 69-75 - [c12]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
1D Effectively Closed Subshifts and 2D Tilings. JAC 2010: 2-7 - [i9]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed point theorem and aperiodic tilings. CoRR abs/1003.2801 (2010) - [i8]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Effective closed subshifts in 1D can be implemented in 2D. CoRR abs/1003.3103 (2010) - [i7]Bruno Durand, Alexander Shen, Andrei E. Romashchenko:
1D Effectively Closed Subshifts and 2D Tilings. CoRR abs/1012.1329 (2010)
2000 – 2009
- 2009
- [j6]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point Theorem and Aperiodic Tilings. Bulletin of the EATCS 97: 126-136 (2009) - [c11]Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. CSR 2009: 250-262 - [c10]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
High Complexity Tilings with Sparse Errors. ICALP (1) 2009: 403-414 - [i6]Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. CoRR abs/0904.3116 (2009) - [i5]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed-point tile sets and their applications. CoRR abs/0910.2415 (2009) - 2008
- [c9]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point and Aperiodic Tilings. Developments in Language Theory 2008: 276-288 - [c8]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen:
Sparse sets. JAC 2008: 18-28 - [c7]Andrei A. Muchnik, Andrei E. Romashchenko:
A Random Oracle Does Not Help Extract the Mutual Information. MFCS 2008: 527-538 - [i4]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point and Aperiodic Tilings. CoRR abs/0802.2432 (2008) - [i3]Bruno Durand, Alexander Shen, Andrei E. Romashchenko:
Fixed Point and Aperiodic Tilings. Electronic Colloquium on Computational Complexity (ECCC) 15(030) (2008) - 2006
- [c6]Andrei E. Romashchenko:
Reliable Computations Based on Locally Decodable Codes. STACS 2006: 537-548 - 2005
- [j5]Troy Lee, Andrei E. Romashchenko:
Resource bounded symmetry of information revisited. Theor. Comput. Sci. 345(2-3): 386-405 (2005) - 2004
- [c5]Troy Lee, Andrei E. Romashchenko:
On Polynomially Time Bounded Symmetry of Information. MFCS 2004: 463-475 - [i2]Troy Lee, Andrei E. Romashchenko:
On Polynomially Time Bounded Symmetry of Information. Electronic Colloquium on Computational Complexity (ECCC)(031) (2004) - 2003
- [j4]Andrei E. Romashchenko:
A Criterion for Extractability of Mutual Information for a Triple of Strings. Probl. Inf. Transm. 39(1): 148-157 (2003) - [c4]Andrei E. Romashchenko:
Extracting the Mutual Information for a Triple of Binary Strings. IEEE Conference on Computational Complexity 2003: 221-229 - 2002
- [j3]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) - [j2]Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Combinatorial interpretation of Kolmogorov complexity. Theor. Comput. Sci. 271(1-2): 111-123 (2002) - 2000
- [j1]Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Inequalities for Shannon Entropy and Kolmogorov Complexity. J. Comput. Syst. Sci. 60(2): 442-464 (2000) - [c3]Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity. IEEE Conference on Computational Complexity 2000: 131-137 - [i1]Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity. Electronic Colloquium on Computational Complexity (ECCC) 7(26) (2000)
1990 – 1999
- 1999
- [c2]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- - 1997
- [c1]Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Inequalities for Shannon entropies and Kolmogorov complexities. IEEE Conference on Computational Complexity 1997: 13-23
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-10-11 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
