| 2025 | MFCS | Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings. | Andrei Romashchenko |
| 2024 | ITW | Common Information in Well-Mixing Graphs and Applications to Information-Theoretic Cryptography. | Geoffroy Caillat-Grenier, Andrei Romashchenko, Rustam Zyavgarov |
| 2024 | STACS | Spectral Approach to the Communication Complexity of Multi-Party Key Agreement. | Geoffroy Caillat-Grenier, Andrei Romashchenko |
| 2020 | MFCS | Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. | Emirhan Grpinar, Andrei Romashchenko |
| 2019 | ISIT | How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. | Emirhan Grpinar, Andrei Romashchenko |
| 2019 | STACS | Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. | Julien Destombes, Andrei Romashchenko |
| 2018 | ICALP | An Operational Characterization of Mutual Information in Algorithmic Information Theory. | Andrei Romashchenko, Marius Zimand |
| 2017 | MFCS | On the Expressive Power of Quasiperiodic SFT. | Bruno Durand, Andrei Romashchenko |
| 2017 | STACS | On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. | Dmitry Itsykson, Alexander Knop, Andrei Romashchenko, Dmitry Sokolov |
| 2015 | MFCS | Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem. | Daniyar Chumbalov, Andrei Romashchenko |
| 2015 | MFCS | Quasiperiodicity and Non-computability in Tilings. | Bruno Durand, Andrei Romashchenko |
| 2012 | ITW | On the non-robustness of essentially conditional information inequalities. | Tarik Kaced, Andrei Romashchenko |
| 2011 | CSR | Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error. | Andrei Romashchenko |
| 2011 | ISIT | On essentially conditional information inequalities. | Tarik Kaced, Andrei Romashchenko |
| 2009 | CSR | Variations on Muchnik's Conditional Complexity Theorem. | Daniil Musatov, Andrei Romashchenko, Alexander Shen |
| 2009 | ICALP | High Complexity Tilings with Sparse Errors. | Bruno Durand, Andrei Romashchenko, Alexander Shen |
| 2008 | DLT | Fixed Point and Aperiodic Tilings. | Bruno Durand, Andrei Romashchenko, Alexander Shen |
| 2008 | MFCS | A Random Oracle Does Not Help Extract the Mutual Information. | Andrei A. Muchnik, Andrei Romashchenko |
| 2006 | STACS | Reliable Computations Based on Locally Decodable Codes. | Andrei Romashchenko |
| 2004 | MFCS | On Polynomially Time Bounded Symmetry of Information. | Troy Lee, Andrei Romashchenko |