Vector Summation within Minimal Angle. - Sergey V. Avgustinovich; Sergey Vasil'evich Sevast'janov (Comput. Geom., 1992)

On Bispecial Words and Subword Complexity of DOL Sequences. - Anna E. Frid; Sergey V. Avgustinovich (SETA, 1998)

Arithmetical Complexity of Infinite Words. - Sergey V. Avgustinovich; Dmitry Fon-Der-Flaass; Anna E. Frid (Words, Languages & Combinatorics, 2000)

Cartesian Products of Graphs and Metric Spaces. - Sergey V. Avgustinovich; Dmitry Fon-Der-Flaass (Eur. J. Comb., 2000)

Perfect binary (n, 3) codes: the structure of graphs of minimum distances. - Sergey V. Avgustinovich (Discret. Appl. Math., 2001)

On the metrical rigidity of binary codes. - Sergey V. Avgustinovich; Faina I. Solov'eva (Electron. Notes Discret. Math., 2001)

Intersection matrices for partitions by binary perfect codes. - Sergey V. Avgustinovich; Antoine Lobstein; Faina I. Solov'eva (IEEE Trans. Inf. Theory, 2001)

Words Avoiding Abelian Inclusions. - Sergey V. Avgustinovich; Anna E. Frid (J. Autom. Lang. Comb., 2002)

To the Metrical Rigidity of Binary Codes. - Sergey V. Avgustinovich; Faina I. Solov'eva (Probl. Inf. Transm., 2003)

On the Ranks and Kernels Problem for Perfect Codes. - Sergey V. Avgustinovich; Faina I. Solov'eva; Olof Heden (Probl. Inf. Transm., 2003)

The Classification of Some Perfect Codes. - Sergey V. Avgustinovich; Olof Heden; Faina I. Solov'eva (Des. Codes Cryptogr., 2004)

Testing sets for 1-perfect codes. - Sergey V. Avgustinovich; Anastasia Yu. Vasil'eva (Electron. Notes Discret. Math., 2005)

A Unique Decomposition Theorem for Factorial Languages. - Sergey V. Avgustinovich; Anna E. Frid (Int. J. Algebra Comput., 2005)

On the Structure of Symmetry Groups of Vasil'ev Codes. - Sergey V. Avgustinovich; Faina I. Solov'eva; Olof Heden (Probl. Inf. Transm., 2005)

Canonical Decomposition of a Regular Factorial Language. - Sergey V. Avgustinovich; Anna E. Frid (CSR, 2006)

Testing Sets for 1-Perfect Code. - Sergey V. Avgustinovich; Anastasia Yu. Vasil'eva (GTIT-C, 2006)

On Intersection Problem for Perfect Binary Codes. - Sergey V. Avgustinovich; Olof Heden; Faina I. Solov'eva (Des. Codes Cryptogr., 2006)

Sequences of low arithmetical complexity. - Sergey V. Avgustinovich; Julien Cassaigne; Anna E. Frid (RAIRO Theor. Informatics Appl., 2006)

On partitions of an n-cube into nonequivalent perfect codes. - Sergey V. Avgustinovich; Faina I. Solov'eva; Olof Heden (Probl. Inf. Transm., 2007)

Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). - Sergey V. Avgustinovich; Ivan Yu. Mogilnykh (ICMCTA, 2008)

On mobile sets in the binary hypercube - Yuriy Vasil'ev; Sergey V. Avgustinovich; Denis S. Krotov (CoRR, 2008)

Embedding in a perfect code - Sergey V. Avgustinovich; Denis S. Krotov (CoRR, 2008)

On uniquely k-determined permutations. - Sergey V. Avgustinovich; Sergey Kitaev (Discret. Math., 2008)

On periodicity of two-dimensional words. - S. A. Puzynina; Sergey V. Avgustinovich (Theor. Comput. Sci., 2008)

On the Number of 1-Perfect Binary Codes: A Lower Bound. - Denis S. Krotov; Sergey V. Avgustinovich (IEEE Trans. Inf. Theory, 2008)

On shortest crucial words avoiding abelian powers. - Sergey V. Avgustinovich; Amy Glen; Bjarni V. Halldórsson; Sergey Kitaev (Discret. Appl. Math., 2010)

On Square-Free Permutations. - Sergey V. Avgustinovich; Sergey Kitaev; Artem V. Pyatkin; Alexandr Valyuzhenich (J. Autom. Lang. Comb., 2011)

Infinite permutations of lowest maximal pattern complexity. - Sergey V. Avgustinovich; Anna E. Frid; Teturo Kamae; Pavel Salimov (Theor. Comput. Sci., 2011)

On abelian versions of critical factorization theorem. - Sergey V. Avgustinovich; Juhani Karhumäki; Svetlana Puzynina (RAIRO Theor. Informatics Appl., 2012)

Avoidance of boxed mesh patterns on permutations. - Sergey V. Avgustinovich; Sergey Kitaev; Alexandr Valyuzhenich (Discret. Appl. Math., 2013)

Canonical Representatives of Morphic Permutations. - Sergey V. Avgustinovich; Anna E. Frid; Svetlana Puzynina (WORDS, 2015)

Ergodic Infinite Permutations of Minimal Complexity. - Sergey V. Avgustinovich; Anna E. Frid; Svetlana Puzynina (DLT, 2015)

Gray coding planar maps. - Sergey V. Avgustinovich; Sergey Kitaev; Vladimir N. Potapov; Vincent Vajnovszki (CoRR, 2015)

Weak Abelian Periodicity of Infinite Words. - Sergey V. Avgustinovich; Svetlana Puzynina (Theory Comput. Syst., 2016)

Gray coding cubic planar maps. - Sergey V. Avgustinovich; Sergey Kitaev; Vladimir N. Potapov; Vincent Vajnovszki (Theor. Comput. Sci., 2016)

Minimal complexity of equidistributed infinite permutations. - Sergey V. Avgustinovich; Anna E. Frid; Svetlana Puzynina (Eur. J. Comb., 2017)

On abelian saturated infinite words. - Sergey V. Avgustinovich; Julien Cassaigne; Juhani Karhumäki; Svetlana Puzynina; Aleksi Saarela (Theor. Comput. Sci., 2019)

On Five Types of Crucial Permutations with Respect to Monotone Patterns. - Sergey V. Avgustinovich; Sergey Kitaev; Anna A. Taranenko (Electron. J. Comb., 2023)

Singleton mesh patterns in multidimensional permutations. - Sergey V. Avgustinovich; Sergey Kitaev; Jeffrey Liese; Vladimir N. Potapov; Anna A. Taranenko (J. Comb. Theory A, 2024)