- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j18 |      | Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich: Avoidance of boxed mesh patterns on permutations. Discrete Applied Mathematics 161(1-2): 43-51 (2013) |
| i3 | | Sergey V. Avgustinovich, Svetlana Puzynina: Weak abelian periodicity of infinite words. CoRR abs/1302.4359 (2013) |
| 2012 | ||
| j17 | | Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina: On abelian versions of critical factorization theorem. RAIRO - Theor. Inf. and Applic. 46(1): 3-15 (2012) |
| 2011 | ||
| j16 |  | Sergey V. Avgustinovich, Sergey Kitaev, Artem V. Pyatkin, Alexandr Valyuzhenich: On Square-Free Permutations. Journal of Automata, Languages and Combinatorics 16(1): 3-10 (2011) |
| j15 | | Sergey V. Avgustinovich, Anna E. Frid, T. Kamae, P. Salimov: Infinite permutations of lowest maximal pattern complexity. Theor. Comput. Sci. 412(27): 2911-2921 (2011) |
| 2010 | ||
| j14 | | Sergey V. Avgustinovich, Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev: On shortest crucial words avoiding abelian powers. Discrete Applied Mathematics 158(6): 605-607 (2010) |
| 2008 | ||
| j13 | | Sergey V. Avgustinovich, Sergey Kitaev: On uniquely k-determined permutations. Discrete Mathematics 308(9): 1500-1507 (2008) |
| j12 | | S. A. Puzynina, Sergey V. Avgustinovich: On periodicity of two-dimensional words. Theor. Comput. Sci. 391(1-2): 178-187 (2008) |
| j11 | | Denis S. Krotov, Sergey V. Avgustinovich: On the Number of 1-Perfect Binary Codes: A Lower Bound. IEEE Transactions on Information Theory 54(4): 1760-1765 (2008) |
| c4 | | Sergey V. Avgustinovich, Ivan 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 | | |
| 2006 | ||
| j10 | | Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid: Sequences of low arithmetical complexity. ITA 40(4): 569-582 (2006) |
| c3 | | Sergey V. Avgustinovich, Anna E. Frid: Canonical Decomposition of a Regular Factorial Language. CSR 2006: 18-22 |
| c2 | | Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva: Testing Sets for 1-Perfect Code. GTIT-C 2006: 938-940 |
| 2005 | ||
| j9 | | Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva: Testing sets for 1-perfect codes. Electronic Notes in Discrete Mathematics 21: 233-236 (2005) |
| j8 | | Sergey V. Avgustinovich, Anna E. Frid: A Unique Decomposition Theorem for Factorial Languages. IJAC 15(1): 149-160 (2005) |
| 2004 | ||
| j7 | | Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva: The Classification of Some Perfect Codes. Des. Codes Cryptography 31(3): 313-318 (2004) |
| 2002 | ||
| j6 | | Sergey V. Avgustinovich, Anna E. Frid: Words Avoiding Abelian Inclusions. Journal of Automata, Languages and Combinatorics 7(1): 3-9 (2002) |
| 2001 | ||
| j5 | | Sergey V. Avgustinovich: Perfect binary (n, 3) codes: the structure of graphs of minimum distances. Discrete Applied Mathematics 114(1-3): 9-11 (2001) |
| j4 | | Sergey V. Avgustinovich, Faina I. Solov'eva: On the metrical rigidity of binary codes. Electronic Notes in Discrete Mathematics 6: 444-451 (2001) |
| j3 | | Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva: Intersection matrices for partitions by binary perfect codes. IEEE Transactions on Information 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) |
| c1 | | Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid: Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics 2000: 51-62 |
| 1992 | ||
| j1 | | Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov: Vector Summation within Minimal Angle. Comput. Geom. 2: 235-239 (1992) |
Colors in the list of coauthors
Last update Thu May 23 19:21:53 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page