Sergey V. Avgustinovich

According to our database1, Sergey V. Avgustinovich authored at least 39 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Singleton mesh patterns in multidimensional permutations.
J. Comb. Theory A, January, 2024

2023
On Five Types of Crucial Permutations with Respect to Monotone Patterns.
Electron. J. Comb., 2023

2019
On abelian saturated infinite words.
Theor. Comput. Sci., 2019

2017
Minimal complexity of equidistributed infinite permutations.
Eur. J. Comb., 2017

2016
Gray coding cubic planar maps.
Theor. Comput. Sci., 2016

Weak Abelian Periodicity of Infinite Words.
Theory Comput. Syst., 2016

2015
Gray coding planar maps.
CoRR, 2015

Ergodic Infinite Permutations of Minimal Complexity.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Canonical Representatives of Morphic Permutations.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2013
Avoidance of boxed mesh patterns on permutations.
Discret. Appl. Math., 2013

2012
On abelian versions of critical factorization theorem.
RAIRO Theor. Informatics Appl., 2012

2011
Infinite permutations of lowest maximal pattern complexity.
Theor. Comput. Sci., 2011

On Square-Free Permutations.
J. Autom. Lang. Comb., 2011

2010
On shortest crucial words avoiding abelian powers.
Discret. Appl. Math., 2010

2008
On the Number of 1-Perfect Binary Codes: A Lower Bound.
IEEE Trans. Inf. Theory, 2008

On periodicity of two-dimensional words.
Theor. Comput. Sci., 2008

On uniquely k-determined permutations.
Discret. Math., 2008

Embedding in a perfect code
CoRR, 2008

On mobile sets in the binary hypercube
CoRR, 2008

Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3).
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.
Probl. Inf. Transm., 2007

2006
Sequences of low arithmetical complexity.
RAIRO Theor. Informatics Appl., 2006

On Intersection Problem for Perfect Binary Codes.
Des. Codes Cryptogr., 2006

Testing Sets for 1-Perfect Code.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Canonical Decomposition of a Regular Factorial Language.
Proceedings of the Computer Science, 2006

2005
On the Structure of Symmetry Groups of Vasil'ev Codes.
Probl. Inf. Transm., 2005

A Unique Decomposition Theorem for Factorial Languages.
Int. J. Algebra Comput., 2005

Testing sets for 1-perfect codes.
Electron. Notes Discret. Math., 2005

2004
The Classification of Some Perfect Codes.
Des. Codes Cryptogr., 2004

2003
On the Ranks and Kernels Problem for Perfect Codes.
Probl. Inf. Transm., 2003

To the Metrical Rigidity of Binary Codes.
Probl. Inf. Transm., 2003

2002
Words Avoiding Abelian Inclusions.
J. Autom. Lang. Comb., 2002

2001
Intersection matrices for partitions by binary perfect codes.
IEEE Trans. Inf. Theory, 2001

On the metrical rigidity of binary codes.
Electron. Notes Discret. Math., 2001

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

2000
Cartesian Products of Graphs and Metric Spaces.
Eur. J. Comb., 2000

Arithmetical Complexity of Infinite Words.
Proceedings of the International Colloquium on Words, 2000

1998
On Bispecial Words and Subword Complexity of DOL Sequences.
Proceedings of the Sequences and their Applications, 1998

1992
Vector Summation within Minimal Angle.
Comput. Geom., 1992


  Loading...