Sergey V. Avgustinovich

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 6

Top Topics

Syntactic Categories

Parallel Manipulator

Top Venues

Theor. Comput. Sci.

Electron. J. Comb.

Publications

Sergey V. Avgustinovich, Sergey Kitaev, Jeffrey Liese, Vladimir N. Potapov, Anna A. Taranenko
Singleton mesh patterns in multidimensional permutations. J. Comb. Theory, Ser. A 201 (2024)
Sergey V. Avgustinovich, Sergey Kitaev, Anna A. Taranenko
On Five Types of Crucial Permutations with Respect to Monotone Patterns. Electron. J. Comb. 30 (1) (2023)
Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
On abelian saturated infinite words. Theor. Comput. Sci. 792 (2019)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Minimal complexity of equidistributed infinite permutations. Eur. J. Comb. 65 (2017)
Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
Gray coding cubic planar maps. Theor. Comput. Sci. 616 (2016)
Sergey V. Avgustinovich, Svetlana Puzynina
Weak Abelian Periodicity of Infinite Words. Theory Comput. Syst. 59 (2) (2016)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Canonical Representatives of Morphic Permutations. CoRR (2015)
Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
Gray coding planar maps. CoRR (2015)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Ergodic Infinite Permutations of Minimal Complexity. DLT (2015)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Canonical Representatives of Morphic Permutations. WORDS (2015)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Ergodic infinite permutations of minimal complexity. CoRR (2015)
Sergey V. Avgustinovich, Svetlana Puzynina
Weak abelian periodicity of infinite words CoRR (2013)
Sergey V. Avgustinovich, Svetlana Puzynina
Weak Abelian Periodicity of Infinite Words. CSR (2013)
Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich
Avoidance of boxed mesh patterns on permutations. Discret. Appl. Math. 161 (1-2) (2013)
Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina
On abelian versions of critical factorization theorem. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Sergey V. Avgustinovich, Anna E. Frid, Teturo Kamae, Pavel Salimov
Infinite permutations of lowest maximal pattern complexity. Theor. Comput. Sci. 412 (27) (2011)
Sergey V. Avgustinovich, Sergey Kitaev, Artem V. Pyatkin, Alexandr Valyuzhenich
On Square-Free Permutations. J. Autom. Lang. Comb. 16 (1) (2011)
Sergey V. Avgustinovich, Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev
On shortest crucial words avoiding abelian powers. Discret. Appl. Math. 158 (6) (2010)
Denis S. Krotov, Sergey V. Avgustinovich
On the Number of 1-Perfect Binary Codes: A Lower Bound. IEEE Trans. Inf. Theory 54 (4) (2008)
Yuriy Vasil'ev, Sergey V. Avgustinovich, Denis S. Krotov
On mobile sets in the binary hypercube CoRR (2008)
Sergey V. Avgustinovich, Sergey Kitaev
On uniquely k-determined permutations. Discret. Math. 308 (9) (2008)
Sergey V. Avgustinovich, Ivan Yu. Mogilnykh
Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). ICMCTA (2008)
S. A. Puzynina, Sergey V. Avgustinovich
On periodicity of two-dimensional words. Theor. Comput. Sci. 391 (1-2) (2008)
Sergey V. Avgustinovich, Denis S. Krotov
Embedding in a perfect code CoRR (2008)
Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden
-cube into nonequivalent perfect codes. Probl. Inf. Transm. 43 (4) (2007)
Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid
Sequences of low arithmetical complexity. RAIRO Theor. Informatics Appl. 40 (4) (2006)
Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva
Testing Sets for 1-Perfect Code. GTIT-C (2006)
Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva
On Intersection Problem for Perfect Binary Codes. Des. Codes Cryptogr. 39 (3) (2006)
Sergey V. Avgustinovich, Anna E. Frid
Canonical Decomposition of a Regular Factorial Language. CSR (2006)
Sergey V. Avgustinovich, Anna E. Frid
A Unique Decomposition Theorem for Factorial Languages. Int. J. Algebra Comput. 15 (1) (2005)
Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden
On the Structure of Symmetry Groups of Vasil'ev Codes. Probl. Inf. Transm. 41 (2) (2005)
Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva
Testing sets for 1-perfect codes. Electron. Notes Discret. Math. 21 (2005)
Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva
The Classification of Some Perfect Codes. Des. Codes Cryptogr. 31 (3) (2004)
Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden
On the Ranks and Kernels Problem for Perfect Codes. Probl. Inf. Transm. 39 (4) (2003)
Sergey V. Avgustinovich, Faina I. Solov'eva
To the Metrical Rigidity of Binary Codes. Probl. Inf. Transm. 39 (2) (2003)
Sergey V. Avgustinovich, Anna E. Frid
Words Avoiding Abelian Inclusions. J. Autom. Lang. Comb. 7 (1) (2002)
Sergey V. Avgustinovich, Faina I. Solov'eva
On the metrical rigidity of binary codes. Electron. Notes Discret. Math. 6 (2001)
Sergey V. Avgustinovich
Perfect binary (n, 3) codes: the structure of graphs of minimum distances. Discret. Appl. Math. 114 (1-3) (2001)
Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva
Intersection matrices for partitions by binary perfect codes. IEEE Trans. Inf. Theory 47 (4) (2001)
Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass
Cartesian Products of Graphs and Metric Spaces. Eur. J. Comb. 21 (7) (2000)
Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid
Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics (2000)
Anna E. Frid, Sergey V. Avgustinovich
On Bispecial Words and Subword Complexity of DOL Sequences. SETA (1998)
Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov
Vector Summation within Minimal Angle. Comput. Geom. 2 (1992)