Andrei Romashchenko
- Centre National de la Recherche Scientifique (CNRS)
- Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM)
- Exact Computing (LIRMM | ECO)
Présentation
See more detailes on my homepage
Domaines de recherche
Publications
Publications
|
|
Spectral approach to the communication complexity of multi-party key agreementSTACS 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⟩ |
|
|
Common information in well-mixing graphs and applications to information-theoretic cryptographyITW 2024 - IEEE Information Theory Workshop, Nov 2023, Shenzhen, China. pp.181-186, ⟨10.1109/ITW61385.2024.10806994⟩ |
|
|
How to Use Undiscovered Information Inequalities: Direct Applications of the Copy LemmaISIT 2019 - IEEE 1st International Symposium on Information Theory, Jul 2019, Paris, France. pp.1377-1381, ⟨10.1109/ISIT.2019.8849309⟩ |
|
|
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional ShiftsSTACS 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⟩ |
|
|
An operational characterization of mutual information in algorithmic information theoryICALP: International Colloquium on Automata, Languages, and Programming, Jul 2018, Prague, Czech Republic. pp.95:1-95:14, ⟨10.4230/LIPIcs.ICALP.2018.95⟩ |
|
|
On the expressive power of quasiperiodic SFTMFCS 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⟩ |
Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf ProblemMFCS: Mathematical Foundations of Computer Science, Aug 2015, Milan, Italy. pp.235-247, ⟨10.1007/978-3-662-48054-0_20⟩ |
|
|
|
Quasiperiodicity and non-computability in tilingsMFCS: Mathematical Foundations of Computer Science, Aug 2015, Milan, Italy. pp.218-230, ⟨10.1007/978-3-662-48057-1_17⟩ |
|
|
Topological arguments for Kolmogorov complexityAUTOMATA, Sep 2012, La Marana, Corsica, France. pp.127-132, ⟨10.4204/EPTCS.90.10⟩ |
|
|
On the Non-robustness of Essentially Conditional Information InequalitiesITW'12: Information Theory Workshop, Sep 2012, Switzerland. pp.1935-1939 |
|
|
Pseudo-random graphs and bit probe schemes with one-sided errorCSR: Computer Science in Russia, Jun 2011, St. Petersburg, Russia. pp.50-63, ⟨10.1007/978-3-642-20712-9_5⟩ |
|
|
On Essentially Conditional Information InequalitiesISIT'11: International Symposium on Information Theory, Jul 2011, St. Petersburg, Russia. pp.1935-1939, ⟨10.1109/ISIT.2011.6033889⟩ |
|
|
1D Effectively Closed Subshifts and 2D TilingsJournées Automates Cellulaires, Dec 2010, Turku, Finland. pp.2-7 |
|
|
FICS 20107th Workshop on Fixed Points in Computer Science, FICS 2010, Aug 2010, Brno, Czech Republic. pp.89 |
|
|
Fixed Point and Aperiodic Tilings12th International Conference on Developments in Language Theory, Sep 2008, Kyoto, Japan. pp.276-288, ⟨10.1007/978-3-540-85780-8_22⟩ |
|
|
Sparse setsJAC 2008, Apr 2008, Uzès, France. pp.18-28 |
Reliable Computations Based on Locally Decodable Codes.23rd Annual Symposium on Theoretical Aspects of Computer Science, Feb 2006, Marseille, France. pp.537--548 |
|
|
Spectral Conditions for the Ingleton Inequality2026 |
|
|
Structural Properties of Entropic Vectors and Stability of the Ingleton Inequality2025 |
|
|
Randomness tests: theory and practice2021 |
|
|
Fixed-point tile sets and their applications2009 |
|
|
Заметки по теории кодированияMCCME Publishers, Moscow, 2017, 978-5-4439-0689-8 |
|
|
Algorithmic Measures of Information for Tuples of Words and for Patterns in Multidimensional Shifts of Finite TypeInformation Theory [math.IT]. Université de Montpellier, 2018 |