Access content directly

Andrei Romashchenko

CRCN CNRS
95%
Open access
37
Documents
Current affiliations
  • 441569
  • 1100620
  • 1100637
Researcher identifiers
Contact

Presentation

See more detailes on my [homepage](http://www.lirmm.fr/~romashchen/ "homepage")
See more detailes on my [homepage](http://www.lirmm.fr/~romashchen/ "homepage")

Research domains

Information Theory [math.IT] Discrete Mathematics [cs.DM] Computational Complexity [cs.CC]

Publications

Image document

Inequalities for space-bounded Kolmogorov complexity

Bruno Bauwens , Peter Gács , Andrei Romashchenko , Alexander Shen
Computability, 2022, 11 (3-4), pp.165-185. ⟨10.3233/COM-210374⟩
Journal articles lirmm-03059686v2
Image document

Clustering with Respect to the Information Distance

Andrei Romashchenko
Theoretical Computer Science, 2022, 929, pp.164-171. ⟨10.1016/j.tcs.2022.06.039⟩
Journal articles lirmm-03370967v1
Image document

Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts

Julien Destombes , Andrei Romashchenko
Journal of Computer and System Sciences, 2022, 128, pp.107-134. ⟨10.1016/j.jcss.2022.04.002⟩
Journal articles lirmm-03646717v1
Image document

27 Open Problems in Kolmogorov Complexity

Andrei Romashchenko , Alexander Shen , Marius Zimand
ACM SIGACT News, 2021, 52 (4), pp.31-54. ⟨10.1145/3510382.3510389⟩
Journal articles lirmm-03631680v1
Image document

The expressiveness of quasiperiodic and minimal shifts of finite type

Bruno Durand , Andrei Romashchenko
Ergodic Theory and Dynamical Systems, 2021, 41 (4), pp.1086-1138. ⟨10.1017/etds.2019.112⟩
Journal articles hal-01702549v1
Image document

On Obdd-Based Algorithms and Proof Systems that Dynamically Change Order of Variables

Dmitry Itsykson , Alexander Knop , Andrei Romashchenko , Dmitry . Sokolov
The Journal of Symbolic Logic, 2020, 85 (2), pp.632-670. ⟨10.1017/jsl.2019.53⟩
Journal articles lirmm-02885744v2

An Operational Characterization of Mutual Information in Algorithmic Information Theory

Andrei Romashchenko , Marius Zimand
Journal of the ACM (JACM), 2019, 66 (5), pp.1-42. ⟨10.1145/3356867⟩
Journal articles lirmm-02297056v1

A Conditional Information Inequality and Its Combinatorial Applications

Andrei Romashchenko , Tarik Kaced , Nikolai Vereshchagin
IEEE Transactions on Information Theory, 2018, 64 (5), pp.3610-3615. ⟨10.1109/TIT.2018.2806486⟩
Journal articles lirmm-01793775v1
Image document

On the Combinatorial Version of the Slepian-Wolf Problem

Daniyar Chumbalov , Andrei Romashchenko
IEEE Transactions on Information Theory, 2018, 64 (9), pp.6054-6069. ⟨10.1109/TIT.2018.2854589⟩
Journal articles lirmm-01233020v1
Image document

Topological Arguments for Kolmogorov Complexity

Andrei Romashchenko , Alexander Shen
Theory of Computing Systems, 2015, 56 (3), pp.513-526. ⟨10.1007/s00224-015-9606-8⟩
Journal articles hal-01165095v1
Image document

Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error

Andrei Romashchenko
Theory of Computing Systems, 2014, 55 (2), pp.313-329. ⟨10.1007/s00224-012-9425-0⟩
Journal articles hal-01165099v1
Image document

The axiomatic power of Kolmogorov complexity

Laurent Bienvenu , Andrei Romashchenko , Alexander Shen , Antoine Taveneaux , Stijn Vermeeren
Annals of Pure and Applied Logic, 2014, 165 (9), pp.1380-1402. ⟨10.1016/j.apal.2014.04.009⟩
Journal articles hal-01165098v1

Conditional Information Inequalities for Entropic and Almost Entropic Points

Tarik Kaced , Andrei Romashchenko
IEEE Transactions on Information Theory, 2013, 59 (11), pp.7149-7167. ⟨10.1109/TIT.2013.2274614⟩
Journal articles lirmm-00848455v1
Image document

Fixed-point tile sets and their applications

Bruno Durand , Andrei Romashchenko , Alexander Shen
Journal of Computer and System Sciences, 2012, 78 (3), pp.731-764. ⟨10.1016/j.jcss.2011.11.001⟩
Journal articles lirmm-00736079v3
Image document

Variations on Muchnik's Conditional Complexity Theorem

Daniil Musatov , Andrei Romashchenko , Alexander Shen
Theory of Computing Systems, 2011, 9 (2), pp.227-245. ⟨10.1007/s00224-011-9321-z⟩
Journal articles lirmm-00736106v1
Image document

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

Emirhan Gürpınar , Andrei Romashchenko
MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.44:1-44:14, ⟨10.4230/LIPIcs.MFCS.2020.44⟩
Conference papers lirmm-02558566v1
Image document

How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma

Emirhan Gürpınar , Andrei Romashchenko
ISIT 2019 - IEEE 1st International Symposium on Information Theory, Jul 2019, Paris, France. pp.1377-1381, ⟨10.1109/ISIT.2019.8849309⟩
Conference papers lirmm-01990325v1
Image document

Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts

Andrei Romashchenko , Julien Destombes
STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.23:1--23:17, ⟨10.4230/LIPIcs.STACS.2019.23⟩
Conference papers lirmm-01793810v1
Image document

An operational characterization of mutual information in algorithmic information theory

Andrei Romashchenko , Marius Zimand
ICALP: International Colloquium on Automata, Languages, and Programming, Jul 2018, Prague, Czech Republic. pp.95:1-95:14, ⟨10.4230/LIPIcs.ICALP.2018.95⟩
Conference papers lirmm-01618559v1
Image document

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables

Dmitry Itsykson , Alexander Knop , Andrei Romashchenko , Dmitry Sokolov
STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2017, Hannover, Germany. pp.43:1-43:14, ⟨10.4230/LIPIcs.STACS.2017.43⟩
Conference papers lirmm-01487646v1
Image document

On the expressive power of quasiperiodic SFT

Andrei Romashchenko , Bruno Durand
MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.5:1-5:14, ⟨10.4230/LIPIcs.MFCS.2017.5⟩
Conference papers lirmm-01623207v1

Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem

Daniyar Chumbalov , Andrei Romashchenko
MFCS: Mathematical Foundations of Computer Science, Aug 2015, Milan, Italy. pp.235-247, ⟨10.1007/978-3-662-48054-0_20⟩
Conference papers lirmm-01233012v1

Quasiperiodicity and non-computability in tilings

Bruno Durand , Andrei Romashchenko
MFCS: Mathematical Foundations of Computer Science, Aug 2015, Milan, Italy. pp.218-230, ⟨10.1007/978-3-662-48057-1_17⟩
Conference papers lirmm-01165314v1
Image document

On the Non-robustness of Essentially Conditional Information Inequalities

Tarik Kaced , Andrei Romashchenko
ITW'12: Information Theory Workshop, Sep 2012, Switzerland. pp.1935-1939
Conference papers lirmm-00736192v1
Image document

Topological arguments for Kolmogorov complexity

Andrei Romashchenko , Alexander Shen
AUTOMATA, Sep 2012, La Marana, Furiani, France. pp.127-132
Conference papers lirmm-00736127v1
Image document

Pseudo-random graphs and bit probe schemes with one-sided error

Andrei Romashchenko
CSR: Computer Science in Russia, Jun 2011, Saint Petersburg, Russia. pp.50-63, ⟨10.1007/978-3-642-20712-9_5⟩
Conference papers lirmm-00736119v1
Image document

On Essentially Conditional Information Inequalities

Tarik Kaced , Andrei Romashchenko
ISIT'11: International Symposium on Information Theory, Jul 2011, St. Petersburg, Russia. pp.1935-1939, ⟨10.1109/ISIT.2011.6033889⟩
Conference papers lirmm-00736159v1
Image document

1D Effectively Closed Subshifts and 2D Tilings

Bruno Durand , Andrei Romashchenko , Alexander Shen
Journées Automates Cellulaires, Dec 2010, Turku, Finland. pp.2-7
Conference papers hal-00541881v1
Image document

FICS 2010

Dale Miller , Arnaud Carayol , Panos Rondogiannis , Lars Birkedal , Marek Czarnecki
7th Workshop on Fixed Points in Computer Science, FICS 2010, Aug 2010, Brno, Czech Republic. pp.89
Conference papers hal-00512377v1
Image document

Sparse sets

Alexander Shen , Laurent Bienvenu , Andrei Romashchenko
JAC 2008, Apr 2008, Uzès, France. pp.18-28
Conference papers hal-00274010v1
Image document

Fixed Point and Aperiodic Tilings

Bruno Durand , Andrei Romashchenko , Alexander Shen
12th International Conference on Developments in Language Theory, Sep 2008, Kyoto, Japan. pp.276-288, ⟨10.1007/978-3-540-85780-8_22⟩
Conference papers hal-00256364v5

Reliable Computations Based on Locally Decodable Codes.

Andrei Romashchenko
23rd Annual Symposium on Theoretical Aspects of Computer Science, Feb 2006, Marseille, France. pp.537--548
Conference papers hal-00293698v1
Image document

Algorithmic Measures of Information for Tuples of Words and for Patterns in Multidimensional Shifts of Finite Type

Andrei Romashchenko
Information Theory [math.IT]. Université de Montpellier, 2018
Habilitation à diriger des recherches tel-01963881v1