Andrei Romashchenko

CRCN CNRS, le Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM )
97%
Libre accès
37
Documents
Affiliations actuelles
  • Centre National de la Recherche Scientifique (CNRS)
  • Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM)
  • Exact Computing (LIRMM | ECO)
Contact

Présentation

See more detailes on my homepage

Domaines de recherche

Théorie de l'information et codage [math.IT] Mathématique discrète [cs.DM] Complexité [cs.CC]

Publications

13
11
4
3
2
2
1
1
12
6
4
4
3
3
3
3
3
3
3
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
13
7
4
3
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
3
3
3
1
3
4
2
2
2
1
3
3
2
1
2
1

Publications

Image document

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

Emirhan Gürpιnar , Andrei Romashchenko
ACM Transactions on Computation Theory, 2024, 16 (3), pp.1-37. ⟨10.1145/3665163⟩
Article dans une revue lirmm-02558566 v2
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⟩
Article dans une revue lirmm-03059686 v2
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⟩
Article dans une revue lirmm-03370967 v1
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⟩
Article dans une revue lirmm-03646717 v1
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⟩
Article dans une revue hal-01702549 v1
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⟩
Article dans une revue lirmm-03631680 v1
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⟩
Article dans une revue lirmm-02885744 v2

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⟩
Article dans une revue lirmm-02297056 v1
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⟩
Article dans une revue lirmm-01233020 v1

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⟩
Article dans une revue lirmm-01793775 v1
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⟩
Article dans une revue hal-01165095 v1
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⟩
Article dans une revue hal-01165099 v1
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⟩
Article dans une revue hal-01165098 v1

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⟩
Article dans une revue lirmm-00848455 v1
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⟩
Article dans une revue lirmm-00736079 v3
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⟩
Article dans une revue lirmm-00736106 v1

Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings

Andrei Romashchenko
50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Aug 2025, Warsaw (POLAND), Poland. pp.84:1-84:18, ⟨10.4230/LIPIcs.MFCS.2025.84⟩
Communication dans un congrès lirmm-05041918 v1

Common information in well-mixing graphs and applications to information-theoretic cryptography

Geoffroy Caillat-Grenier , Andrei Romashchenko , Rustam Zyavgarov
ITW 2024 - IEEE Information Theory Workshop, Nov 2023, Shenzhen, China. pp.181-186, ⟨10.1109/ITW61385.2024.10806994⟩
Communication dans un congrès lirmm-04572079 v1
Image document

Spectral approach to the communication complexity of multi-party key agreement

Geoffroy Caillat-Grenier , Andrei Romashchenko
STACS 2024 - 41st International Symposium on Theoretical Aspects of Computer Science, Mar 2024, Clermont-Ferrand, France. pp.22:1-22:19, ⟨10.4230/LIPIcs.STACS.2024.22⟩
Communication dans un congrès lirmm-04087184 v1
Image document

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

Emirhan Gurpinar , Andrei Romashchenko
ISIT 2019 - IEEE 1st International Symposium on Information Theory, Jul 2019, Paris, France. pp.1377-1381, ⟨10.1109/ISIT.2019.8849309⟩
Communication dans un congrès lirmm-01990325 v1
Image document

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

Julien Destombes , Andrei Romashchenko
STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Germany, France. pp.23:1--23:17, ⟨10.4230/LIPIcs.STACS.2019.23⟩
Communication dans un congrès lirmm-01793810 v1
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⟩
Communication dans un congrès lirmm-01618559 v1
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⟩
Communication dans un congrès lirmm-01623207 v1

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⟩
Communication dans un congrès lirmm-01165314 v1
Image document

Topological arguments for Kolmogorov complexity

Alexander Shen , Andrei Romashchenko
AUTOMATA, Sep 2012, La Marana, Corsica, France. pp.127-132, ⟨10.4204/EPTCS.90.10⟩
Communication dans un congrès lirmm-00736127 v1
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
Communication dans un congrès lirmm-00736192 v1
Image document

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

Andrei Romashchenko
CSR: Computer Science in Russia, Jun 2011, St. Petersburg, Russia. pp.50-63, ⟨10.1007/978-3-642-20712-9_5⟩
Communication dans un congrès lirmm-00736119 v1
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⟩
Communication dans un congrès lirmm-00736159 v1
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
Communication dans un congrès hal-00541881 v1
Image document

FICS 2010

Dale Miller , Arnaud Carayol , Panos Rondogiannis , Lars Birkedal , Marek Czarnecki et al.
7th Workshop on Fixed Points in Computer Science, FICS 2010, Aug 2010, Brno, Czech Republic. pp.89
Communication dans un congrès hal-00512377 v1
Image document

Sparse sets

Alexander Shen , Laurent Bienvenu , Andrei Romashchenko
JAC 2008, Apr 2008, Uzès, France. pp.18-28
Communication dans un congrès hal-00274010 v1
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⟩
Communication dans un congrès hal-00256364 v5

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
Communication dans un congrès hal-00293698 v1