- 15
- 10
- 4
- 2
- 2
- 2
- 1
- 1
Andrei Romashchenko
CRCN CNRS, le Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM )
95%
Libre accès
37
Documents
Affiliations actuelles
- 441569
- 1100620
- 1100637
Identifiants chercheurs
- andrei-romashchenko
- ResearcherId : H-7456-2012
- 0000-0001-7723-7880
- IdRef : 165481277
- ResearcherId : http://www.researcherid.com/rid/H-7456-2012
- Arxiv : romashchenko_a_1
- Google Scholar : https://scholar.google.fr/citations?user=WmvoaNcAAAAJ
Présentation
See more detailes on my [homepage](http://www.lirmm.fr/~romashchen/ "homepage")
See more detailes on my [homepage](http://www.lirmm.fr/~romashchen/ "homepage")
Domaines de recherche
Théorie de l'information et codage [math.IT]
Mathématique discrète [cs.DM]
Complexité [cs.CC]
Publications
- 9
- 6
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 13
- 7
- 4
- 3
- 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
- 3
- 3
- 2
- 3
- 4
- 3
- 3
- 2
- 1
- 3
- 3
- 2
- 1
- 2
- 1
|
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⟩
Communication dans un congrès
lirmm-04087184v1
|
|
Communication Complexity of the Secret Key Agreement in Algorithmic Information TheoryMFCS 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⟩
Communication dans un congrès
lirmm-02558566v1
|
|
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⟩
Communication dans un congrès
lirmm-01990325v1
|
|
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional ShiftsSTACS 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⟩
Communication dans un congrès
lirmm-01793810v1
|
|
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⟩
Communication dans un congrès
lirmm-01618559v1
|
|
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of VariablesSTACS: Symposium on Theoretical Aspects of Computer Science, Mar 2017, Hannover, Germany. pp.43:1-43:14, ⟨10.4230/LIPIcs.STACS.2017.43⟩
Communication dans un congrès
lirmm-01487646v1
|
|
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⟩
Communication dans un congrès
lirmm-01623207v1
|
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⟩
Communication dans un congrès
lirmm-01233012v1
|
|
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⟩
Communication dans un congrès
lirmm-01165314v1
|
|
|
Topological arguments for Kolmogorov complexityAUTOMATA, Sep 2012, La Marana, Furiani, France. pp.127-132
Communication dans un congrès
lirmm-00736127v1
|
|
On the Non-robustness of Essentially Conditional Information InequalitiesITW'12: Information Theory Workshop, Sep 2012, Switzerland. pp.1935-1939
Communication dans un congrès
lirmm-00736192v1
|
|
On Essentially Conditional Information InequalitiesISIT'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-00736159v1
|
|
Pseudo-random graphs and bit probe schemes with one-sided errorCSR: Computer Science in Russia, Jun 2011, Saint Petersburg, Russia. pp.50-63, ⟨10.1007/978-3-642-20712-9_5⟩
Communication dans un congrès
lirmm-00736119v1
|
|
FICS 20107th Workshop on Fixed Points in Computer Science, FICS 2010, Aug 2010, Brno, Czech Republic. pp.89
Communication dans un congrès
hal-00512377v1
|
|
1D Effectively Closed Subshifts and 2D TilingsJournées Automates Cellulaires, Dec 2010, Turku, Finland. pp.2-7
Communication dans un congrès
hal-00541881v1
|
|
Sparse setsJAC 2008, Apr 2008, Uzès, France. pp.18-28
Communication dans un congrès
hal-00274010v1
|
|
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⟩
Communication dans un congrès
hal-00256364v5
|
Reliable Computations Based on Locally Decodable Codes.23rd Annual Symposium on Theoretical Aspects of Computer Science, Feb 2006, Marseille, France. pp.537--548
Communication dans un congrès
hal-00293698v1
|
|
Randomness tests: theory and practice2021
Pré-publication, Document de travail
lirmm-03371151v1
|
|
Fixed-point tile sets and their applications2009
Pré-publication, Document de travail
hal-00424024v5
|
|
Заметки по теории кодированияMCCME Publishers, Moscow, 2017, 978-5-4439-0689-8
Ouvrages
lirmm-01486509v1
|
|
Algorithmic Measures of Information for Tuples of Words and for Patterns in Multidimensional Shifts of Finite TypeInformation Theory [math.IT]. Université de Montpellier, 2018
HDR
tel-01963881v1
|