Nombre de documents

22

CV HAL : Andrei Romashchenko


See more detailes on my homepage


Article dans une revue6 documents

Communication dans un congrès13 documents

  • Andrei Romashchenko, Bruno Durand. On the expressive power of quasiperiodic SFT. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aug 2017, Aalborg, Denmark. 83, pp.5:1-5:14, 2017, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). 〈http://drops.dagstuhl.de/portals/extern/index.php?semnr=16053〉. 〈10.4230/LIPIcs.MFCS.2017.5〉. 〈lirmm-01623207〉
  • Dmitry Itsykson, Alexander Knop, Andrei Romashchenko, Dmitry Sokolov. On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2017, Hannover, Germany. 34th Symposium on Theoretical Aspects of Computer Science, 66, pp.43:1-43:14, 2017, Leibniz International Proceedings in Informatics (LIPIcs). 〈https://stacs2017.thi.uni-hannover.de〉. 〈10.4230/LIPIcs.STACS.2017.43〉. 〈lirmm-01487646〉
  • Bruno Durand, Andrei Romashchenko. Quasiperiodicity and non-computability in tilings. MFCS: Mathematical Foundations of Computer Science, Aug 2015, Milan, Italy. MFCS'2015: 40th International Symposium on Mathematical Foundations of Computer Science, 2015, 〈http://mfcs2015.di.unimi.it〉. 〈10.1007/978-3-662-48057-1_17〉. 〈lirmm-01165314〉
  • Chumbalov Daniyar, Andrei Romashchenko. Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem. MFCS: Mathematical Foundations of Computer Science, Aug 2015, Milan, Italy. LNCS (9235), pp.235-247, 2015, 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II. 〈10.1007/978-3-662-48054-0_20〉. 〈lirmm-01233012〉
  • Tarik Kaced, Andrei Romashchenko. On the Non-robustness of Essentially Conditional Information Inequalities. ITW'12: Information Theory Workshop, Sep 2012, Switzerland. pp.1935-1939, 2012, 〈itw2012.epfl.ch/〉. 〈lirmm-00736192〉
  • Andrei Romashchenko, Alexander Shen. Topological arguments for Kolmogorov complexity. AUTOMATA, Sep 2012, La Marana, Furiani, France. 18th International Workshop on Cellular Automata and Discrete Complex Systems, pp.127-132, 2012, 〈http://www.i3s.unice.fr/automata2012/〉. 〈lirmm-00736127〉
  • Andrei Romashchenko. Pseudo-random graphs and bit probe schemes with one-sided error. CSR: Computer Science Symposium in Russia, Jun 2011, Saint Petersburg, Russia. 6th International Computer Science Symposium in Russia, pp.50-63, 2011. 〈lirmm-00736119〉
  • Tarik Kaced, Andrei Romashchenko. On Essentially Conditional Information Inequalities. ISIT'11: International Symposium on Information Theory, Jul 2011, St. Petersburg, Russia. pp.1935-1939, 2011, 〈http://www.isit2011.org/〉. 〈10.1109/ISIT.2011.6033889〉. 〈lirmm-00736159〉
  • Dale Miller, Arnaud Carayol, Panos Rondogiannis, Lars Birkedal, Marek Czarnecki, et al.. FICS 2010. Luigi Santocanale. 7th Workshop on Fixed Points in Computer Science, FICS 2010, Aug 2010, Brno, Czech Republic. pp.89, 2010. 〈hal-00512377〉
  • , Andrei Romashchenko, Alexander Shen. 1D Effectively Closed Subshifts and 2D Tilings. TUCS. Journées Automates Cellulaires, Dec 2010, Turku, Finland. pp.2-7, 2010. 〈hal-00541881〉
  • Alexander Shen, Laurent Bienvenu, Andrei Romashchenko. Sparse sets. Bruno Durand. JAC 2008, Apr 2008, Uzès, France. Издательство МЦНМО, pp.18-28, 2008, Invited talk. 〈hal-00274010〉
  • Bruno Durand, Andrei Romashchenko, Alexander Shen. Fixed Point and Aperiodic Tilings. 12th International Conference on Developments in Language Theory, Sep 2008, Kyoto, Japan. 5257, pp.276-288, 2008, Lecture Notes in Computer Science. 〈10.1007/978-3-540-85780-8_22〉. 〈hal-00256364v5〉
  • Andrei Romashchenko. Reliable Computations Based on Locally Decodable Codes.. 23rd Annual Symposium on Theoretical Aspects of Computer Science, Feb 2006, Marseille, France. pp.537--548, 2006. 〈hal-00293698〉

Pré-publication, Document de travail3 documents

  • Andrei Romashchenko, Marius Zimand. An operational characterization of mutual information in algorithmic information theory. 2017. 〈lirmm-01618559〉
  • Daniyar Chumbalov, Andrei Romashchenko. On the Combinatorial Version of the Slepian-Wolf Problem. 2015. 〈lirmm-01233020〉
  • , Andrei Romashchenko, Alexander Shen. Fixed-point tile sets and their applications. v4: added references to a paper by Nicolas Ollinger and several historical comments. 2009. 〈hal-00424024v5〉