Sergey V. Avgustinovich

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