# Yulia Medvedeva

### PhD (Candidate of Technical Sciences) in Theoretical Basis of Informatics

### Ukraine, Kharkiv

My research is on design of fast enumerative coding algorithms for some classes of combinatorial
objects. I have proposed the enumerative coding algorithms for run-length limited words, elements
of Grassmannian, Dyck words. The proposed algorithms have significantly less computational complexity
than known ones.
I have got PhD degree and used to work in Department of Applied Mathematics and Cybernetics,
Siberian State University of Telecommunications and Information Sciences, Novosibirsk, Russia. In 2016 I moved to Ukraine and I am currently unemployed, because I haven't obtained Ukrainian citizenship yet.

Selected publications:

1. Y. Medvedeva, B. Ryabko.
Fast enumeration of run-length-limited words.
Proceedings of IEEE International Symposium on
Information Theory (ISIT'09), Seoul, South Korea, 2009, pp. 640—643. [acm] [pdf]

2. Y. Medvedeva.
Fast enumeration for Grassmannian space.
2012 XIII International Symposium on Problems of
Redundancy in Information and Control Systems (RED), 2012, pp. 48—52. [ieee xplore] [pdf]

3. Yu. S. Medvedeva, B. Ya. Ryabko.
Fast enumeration algorithm for words
with given constraints on run lengths of ones.
Problems of Information Transmission, 2010, 46:4, pp. 390—399. [springer] [pdf]

4. Yu. S. Medvedeva. Fast enumeration of words generated by Dyck grammars.
Mathematical Notes, 2014, 96:1-2, pp. 68—83. [springer] [pdf]

Other publications:

Yu. S. Medvedeva.
Fast algorithm of enumerational encoding for main problems of information theory.
All-Russian Conference of Young Scientists on
Mathematical Modeling and Information Technologies,
Tomsk, Russia, 2013.

Y. S. Medvedeva. Fast enumeration of Grassmannian elements. Computational technologies, 2013, V. 18, № 3, pp. 22—33.
[ct] [ct russian] [pdf russian]

Yu. Medvedeva. Fast algorithm of enumerative encoding for main problems of information theory. Vestnik SibGUTI, 2013, № 4, pp. 83—105.
[abstract pdf] [vestnik russian]
[pdf russian]

Yu. Medvedeva.
Fast enumeration of Grassmannian elements.
Proceedings of XI International Seminar "Discrete Mathematics and its Applications",
Moscow, Russia, 2012.

Y. S. Medvedeva.
Fast algorithm of enumeration of words with given constraint on series length.
All-Russian Conference of Young Scientists on
Mathematical Modeling and Information Technologies,
Kemerovo, Russia, 2008.

brainwashedyandex.ua

mjuljagmail.com

Skype: j.moari