default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei 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
2020 – today
- 2024
[j23]Emirhan Gürpinar, Andrei E. Romashchenko
:
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. ACM Trans. Comput. Theory 16(3): 13:1-13:37 (2024)- [c27]Geoffroy Caillat-Grenier, Andrei E. Romashchenko:
Spectral Approach to the Communication Complexity of Multi-Party Key Agreement. STACS 2024: 22:1-22:19 - [i34]Geoffroy Caillat-Grenier, Andrei E. Romashchenko, Rustam Zyavgarov:
Common information in well-mixing graphs and applications to information-theoretic cryptography. CoRR abs/2405.05831 (2024) - 2023
- [i33]Geoffroy Caillat-Grenier, Andrei E. Romashchenko:
Spectral approach to the communication complexity of multi-party key agreement. CoRR abs/2305.01355 (2023) - 2022
- [j22]Bruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. Comput. 11(3-4): 165-185 (2022) - [j21]Julien Destombes, Andrei E. Romashchenko:
Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts. J. Comput. Syst. Sci. 128: 107-134 (2022) - [j20]Andrei E. Romashchenko:
Clustering with respect to the information distance. Theor. Comput. Sci. 929: 164-171 (2022) - [i32]Andrei E. Romashchenko, Alexander Shen, Marius Zimand:
27 Open Problems in Kolmogorov Complexity. CoRR abs/2203.15109 (2022) - [i31]Phokion G. Kolaitis, Andrei E. Romashchenko, Milan Studený, Dan Suciu, Tobias Boege:
Algorithmic Aspects of Information Theory (Dagstuhl Seminar 22301). Dagstuhl Reports 12(7): 180-204 (2022) - 2021
- [j19]Andrei E. Romashchenko, Alexander Shen, Marius Zimand:
27 Open Problems in Kolmogorov Complexity. SIGACT News 52(4): 31-54 (2021) - [i30]Andrei E. Romashchenko:
Clustering with Respect to the Information Distance. CoRR abs/2110.01346 (2021) - 2020
- [j18]Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables. J. Symb. Log. 85(2): 632-670 (2020) - [c26]Emirhan Gürpinar, Andrei E. Romashchenko:
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. MFCS 2020: 44:1-44:14 - [i29]Emirhan Gürpinar, Andrei E. Romashchenko:
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. CoRR abs/2004.13411 (2020) - [i28]Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. CoRR abs/2010.10221 (2020)
2010 – 2019
- 2019
- [j17]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. Electron. Colloquium Comput. Complex. TR19 (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 - [j16]Tarik Kaced, Andrei E. Romashchenko, Nikolai K. Vereshchagin:
A Conditional Information Inequality and Its Combinatorial Applications. IEEE Trans. Inf. Theory 64(5): 3610-3615 (2018) - [j15]Daniyar Chumbalov, Andrei E. Romashchenko:
On the Combinatorial Version of the Slepian-Wolf Problem. IEEE Trans. Inf. 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. Electron. Colloquium Comput. Complex. TR18 (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
- [j14]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
- [j13]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren:
The axiomatic power of Kolmogorov complexity. Ann. Pure Appl. Log. 165(9): 1380-1402 (2014) - [j12]Andrei E. Romashchenko:
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error. Theory Comput. Syst. 55(2): 313-329 (2014) - 2013
- [j11]Tarik Kaced, Andrei E. Romashchenko:
Conditional Information Inequalities for Entropic and Almost Entropic Points. IEEE Trans. Inf. 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
- [j10]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
- [j9]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
- [j8]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
- [j7]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point Theorem and Aperiodic Tilings. Bull. 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. Electron. Colloquium Comput. Complex. TR08 (2008) - 2006
- [c6]Andrei E. Romashchenko:
Reliable Computations Based on Locally Decodable Codes. STACS 2006: 537-548 - 2005
- [j6]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. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j5]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. CCC 2003: 221-229 - 2002
- [j4]Konstantin Makarychev, Yury Makarychev, Andrei E. Romashchenko, Nikolai K. Vereshchagin:
A new class of non-Shannon-type inequalities for entropies. Commun. Inf. Syst. 2(2): 147-166 (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. CCC 2000: 131-137 - [i1]Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR00 (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". CCC 1999: 114- - 1997
- [c1]Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Inequalities for Shannon entropies and Kolmogorov complexities. CCC 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).
Privacy notice: By enabling the option above, your browser will contact the API of 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, opencitations.net, and semanticscholar.org to load article reference 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, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and 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 and semanticscholar.org 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 as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2024-12-26 01:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
