# Andrei E. Romashchenko

According to our database

Collaborative distances:

^{1}, Andrei E. Romashchenko authored at least 46 papers between 1997 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2020

On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables.

J. Symb. Log., 2020

CoRR, 2020

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory.

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

An Operational Characterization of Mutual Information in Algorithmic Information Theory.

J. ACM, 2019

On a conditional inequality in Kolmogorov complexity and its applications in communication complexity.

CoRR, 2019

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

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

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

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

IEEE Trans. Inf. Theory, 2018

IEEE Trans. Inf. Theory, 2018

CoRR, 2018

Algorithmic Measures of Information for Tuples of Words and for Patterns in Multidimensional Shifts of Finite Type.

, 2018

2017

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

CoRR, 2016

2015

Theory Comput. Syst., 2015

CoRR, 2015

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Theory Comput. Syst., 2014

Ann. Pure Appl. Log., 2014

2013

IEEE Trans. Inf. Theory, 2013

2012

J. Comput. Syst. Sci., 2012

CoRR, 2012

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011

Theory Comput. Syst., 2011

CoRR, 2011

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Probl. Inf. Transm., 2010

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

Proceedings of the 7th Workshop on Fixed Points in Computer Science, 2010

Proceedings of the Fields of Logic and Computation, 2010

2009

Fixed Point Theorem and Aperiodic Tilings.

Bull. EATCS, 2009

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Electron. Colloquium Comput. Complex., 2008

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Sparse sets.

Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

2006

Proceedings of the STACS 2006, 2006

2005

Theor. Comput. Sci., 2005

2004

Electron. Colloquium Comput. Complex., 2004

2003

Probl. Inf. Transm., 2003

Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002

Theor. Comput. Sci., 2002

Upper semi-lattice of binary strings with the relation "x is simple conditional to y".

Theor. Comput. Sci., 2002

Commun. Inf. Syst., 2002

2000

J. Comput. Syst. Sci., 2000

1999

Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y".

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1997

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997