Sergey V. Avgustinovich

J. Comb. Theory A, January, 2024

2023

On Five Types of Crucial Permutations with Respect to Monotone Patterns.

[BibT_eX]

[DOI]

Anna A. Taranenko

Electron. J. Comb., 2023

2019

On abelian saturated infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

2017

Minimal complexity of equidistributed infinite permutations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

2016

Gray coding cubic planar maps.

[BibT_eX]

[DOI]

Vladimir N. Potapov

Vincent Vajnovszki

Theor. Comput. Sci., 2016

Weak Abelian Periodicity of Infinite Words.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

2015

Gray coding planar maps.

[BibT_eX]

[DOI]

Vladimir N. Potapov

Vincent Vajnovszki

CoRR, 2015

Ergodic Infinite Permutations of Minimal Complexity.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Canonical Representatives of Morphic Permutations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2013

Avoidance of boxed mesh patterns on permutations.

[BibT_eX]

[DOI]

Alexandr Valyuzhenich

Discret. Appl. Math., 2013

2012

On abelian versions of critical factorization theorem.

[BibT_eX]

[DOI]

Juhani Karhumäki

RAIRO Theor. Informatics Appl., 2012

2011

Infinite permutations of lowest maximal pattern complexity.

[BibT_eX]

[DOI]

Teturo Kamae

Pavel Salimov

Theor. Comput. Sci., 2011

On Square-Free Permutations.

[BibT_eX]

[DOI]

Artem V. Pyatkin

Alexandr Valyuzhenich

J. Autom. Lang. Comb., 2011

2010

On shortest crucial words avoiding abelian powers.

[BibT_eX]

[DOI]

Amy Glen

Bjarni V. Halldórsson

Discret. Appl. Math., 2010

2008

On the Number of 1-Perfect Binary Codes: A Lower Bound.

[BibT_eX]

[DOI]

Denis S. Krotov

IEEE Trans. Inf. Theory, 2008

On periodicity of two-dimensional words.

[BibT_eX]

[DOI]

S. A. Puzynina

Theor. Comput. Sci., 2008

On uniquely k-determined permutations.

[BibT_eX]

[DOI]

Discret. Math., 2008

Embedding in a perfect code

[BibT_eX]

[DOI]

Denis S. Krotov

CoRR, 2008

On mobile sets in the binary hypercube

[BibT_eX]

[DOI]

Yuriy Vasil'ev

Denis S. Krotov

CoRR, 2008

Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3).

[BibT_eX]

[DOI]

Ivan Yu. Mogilnykh

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007

On partitions of an <i>n</i>-cube into nonequivalent perfect codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2007

2006

Sequences of low arithmetical complexity.

[BibT_eX]

[DOI]

Julien Cassaigne

RAIRO Theor. Informatics Appl., 2006

On Intersection Problem for Perfect Binary Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2006

Testing Sets for 1-Perfect Code.

[BibT_eX]

[DOI]

Anastasia Yu. Vasil'eva

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Canonical Decomposition of a Regular Factorial Language.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2006

2005

On the Structure of Symmetry Groups of Vasil'ev Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2005

A Unique Decomposition Theorem for Factorial Languages.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2005

Testing sets for 1-perfect codes.

[BibT_eX]

[DOI]

Anastasia Yu. Vasil'eva

Electron. Notes Discret. Math., 2005

2004

The Classification of Some Perfect Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2004

2003

On the Ranks and Kernels Problem for Perfect Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2003

To the Metrical Rigidity of Binary Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2003

2002

Words Avoiding Abelian Inclusions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

2001

Intersection matrices for partitions by binary perfect codes.

[BibT_eX]

[DOI]

Antoine Lobstein

IEEE Trans. Inf. Theory, 2001

On the metrical rigidity of binary codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Perfect binary (n, 3) codes: the structure of graphs of minimum distances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Cartesian Products of Graphs and Metric Spaces.

[BibT_eX]

[DOI]

Dmitry Fon-Der-Flaass

Eur. J. Comb., 2000

Arithmetical Complexity of Infinite Words.

[BibT_eX]

Dmitry Fon-Der-Flaass

Proceedings of the International Colloquium on Words, 2000

1998

On Bispecial Words and Subword Complexity of DOL Sequences.

[BibT_eX]

[DOI]

Proceedings of the Sequences and their Applications, 1998

1992

Vector Summation within Minimal Angle.

[BibT_eX]

[DOI]