default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey V. Avgustinovich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Sergey V. Avgustinovich, Sergey Kitaev, Jeffrey Liese
, Vladimir N. Potapov, Anna A. Taranenko:
Singleton mesh patterns in multidimensional permutations. J. Comb. Theory A 201: 105801 (2024)- 2023
- [j28]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)
2010 – 2019
- 2019
- [j27]Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela:
On abelian saturated infinite words. Theor. Comput. Sci. 792: 154-160 (2019) - 2017
- [j26]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Minimal complexity of equidistributed infinite permutations. Eur. J. Comb. 65: 24-36 (2017) - 2016
- [j25]Sergey V. Avgustinovich, Svetlana Puzynina:
Weak Abelian Periodicity of Infinite Words. Theory Comput. Syst. 59(2): 161-179 (2016) - [j24]Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
Gray coding cubic planar maps. Theor. Comput. Sci. 616: 59-69 (2016) - 2015
- [c8]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Canonical Representatives of Morphic Permutations. WORDS 2015: 59-72 - [c7]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Ergodic Infinite Permutations of Minimal Complexity. DLT 2015: 71-84 - [i6]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Ergodic infinite permutations of minimal complexity. CoRR abs/1503.06188 (2015) - [i5]Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
Gray coding planar maps. CoRR abs/1509.05807 (2015) - [i4]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Canonical Representatives of Morphic Permutations. CoRR abs/1510.08371 (2015) - 2013
- [j23]Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich:
Avoidance of boxed mesh patterns on permutations. Discret. Appl. Math. 161(1-2): 43-51 (2013) - [c6]Sergey V. Avgustinovich, Svetlana Puzynina:
Weak Abelian Periodicity of Infinite Words. CSR 2013: 258-270 - [i3]Sergey V. Avgustinovich, Svetlana Puzynina:
Weak abelian periodicity of infinite words. CoRR abs/1302.4359 (2013) - 2012
- [j22]Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina:
On abelian versions of critical factorization theorem. RAIRO Theor. Informatics Appl. 46(1): 3-15 (2012) - 2011
- [j21]Sergey V. Avgustinovich, Sergey Kitaev, Artem V. Pyatkin, Alexandr Valyuzhenich:
On Square-Free Permutations. J. Autom. Lang. Comb. 16(1): 3-10 (2011) - [j20]Sergey V. Avgustinovich, Anna E. Frid, Teturo Kamae, Pavel Salimov:
Infinite permutations of lowest maximal pattern complexity. Theor. Comput. Sci. 412(27): 2911-2921 (2011) - 2010
- [j19]Sergey V. Avgustinovich, Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev:
On shortest crucial words avoiding abelian powers. Discret. Appl. Math. 158(6): 605-607 (2010)
2000 – 2009
- 2008
- [j18]Sergey V. Avgustinovich, Sergey Kitaev:
On uniquely k-determined permutations. Discret. Math. 308(9): 1500-1507 (2008) - [j17]S. A. Puzynina, Sergey V. Avgustinovich:
On periodicity of two-dimensional words. Theor. Comput. Sci. 391(1-2): 178-187 (2008) - [j16]Denis S. Krotov, Sergey V. Avgustinovich:
On the Number of 1-Perfect Binary Codes: A Lower Bound. IEEE Trans. Inf. Theory 54(4): 1760-1765 (2008) - [c5]Sergey V. Avgustinovich, Ivan Yu. Mogilnykh:
Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). ICMCTA 2008: 11-19 - [i2]Yuriy Vasil'ev, Sergey V. Avgustinovich, Denis S. Krotov:
On mobile sets in the binary hypercube. CoRR abs/0802.0003 (2008) - [i1]Sergey V. Avgustinovich, Denis S. Krotov:
Embedding in a perfect code. CoRR abs/0804.0006 (2008) - 2007
- [j15]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On partitions of an n-cube into nonequivalent perfect codes. Probl. Inf. Transm. 43(4): 310-315 (2007) - 2006
- [j14]Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva:
On Intersection Problem for Perfect Binary Codes. Des. Codes Cryptogr. 39(3): 317-322 (2006) - [j13]Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid:
Sequences of low arithmetical complexity. RAIRO Theor. Informatics Appl. 40(4): 569-582 (2006) - [c4]Sergey V. Avgustinovich, Anna E. Frid:
Canonical Decomposition of a Regular Factorial Language. CSR 2006: 18-22 - [c3]Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva:
Testing Sets for 1-Perfect Code. GTIT-C 2006: 938-940 - 2005
- [j12]Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva:
Testing sets for 1-perfect codes. Electron. Notes Discret. Math. 21: 233-236 (2005) - [j11]Sergey V. Avgustinovich, Anna E. Frid:
A Unique Decomposition Theorem for Factorial Languages. Int. J. Algebra Comput. 15(1): 149-160 (2005) - [j10]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On the Structure of Symmetry Groups of Vasil'ev Codes. Probl. Inf. Transm. 41(2): 105-112 (2005) - 2004
- [j9]Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva:
The Classification of Some Perfect Codes. Des. Codes Cryptogr. 31(3): 313-318 (2004) - 2003
- [j8]Sergey V. Avgustinovich, Faina I. Solov'eva:
To the Metrical Rigidity of Binary Codes. Probl. Inf. Transm. 39(2): 178-183 (2003) - [j7]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On the Ranks and Kernels Problem for Perfect Codes. Probl. Inf. Transm. 39(4): 341-345 (2003) - 2002
- [j6]Sergey V. Avgustinovich, Anna E. Frid:
Words Avoiding Abelian Inclusions. J. Autom. Lang. Comb. 7(1): 3-9 (2002) - 2001
- [j5]Sergey V. Avgustinovich:
Perfect binary (n, 3) codes: the structure of graphs of minimum distances. Discret. Appl. Math. 114(1-3): 9-11 (2001) - [j4]Sergey V. Avgustinovich, Faina I. Solov'eva:
On the metrical rigidity of binary codes. Electron. Notes Discret. Math. 6: 444-451 (2001) - [j3]Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva:
Intersection matrices for partitions by binary perfect codes. IEEE Trans. Inf. Theory 47(4): 1621-1624 (2001) - 2000
- [j2]Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass:
Cartesian Products of Graphs and Metric Spaces. Eur. J. Comb. 21(7): 847-851 (2000) - [c2]Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid:
Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics 2000: 51-62
1990 – 1999
- 1998
- [c1]Anna E. Frid, Sergey V. Avgustinovich:
On Bispecial Words and Subword Complexity of DOL Sequences. SETA 1998: 191-204 - 1992
- [j1]Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov:
Vector Summation within Minimal Angle. Comput. Geom. 2: 235-239 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
