Sergey V. Avgustinovich

	2011
21		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
20		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
19		Sergey V. Avgustinovich, Ivan Mogilnykh: Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). ICMCTA 2008: 11-19
18		Yuriy Vasil'ev, Sergey V. Avgustinovich, Denis S. Krotov: On mobile sets in the binary hypercube CoRR abs/0802.0003: (2008)
17		Sergey V. Avgustinovich, Denis S. Krotov: Embedding in a perfect code CoRR abs/0804.0006: (2008)
16		Sergey V. Avgustinovich, Sergey Kitaev: On uniquely k-determined permutations. Discrete Mathematics 308(9): 1500-1507 (2008)
15		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)
14		S. A. Puzynina, Sergey V. Avgustinovich: On periodicity of two-dimensional words. Theor. Comput. Sci. 391(1-2): 178-187 (2008)
	2006
13		Sergey V. Avgustinovich, Anna E. Frid: Canonical Decomposition of a Regular Factorial Language. CSR 2006: 18-22
12		Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva: Testing Sets for 1-Perfect Code. GTIT-C 2006: 938-940
11		Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid: Sequences of low arithmetical complexity. ITA 40(4): 569-582 (2006)
	2005
10		Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva: Testing sets for 1-perfect codes. Electronic Notes in Discrete Mathematics 21: 233-236 (2005)
9		Sergey V. Avgustinovich, Anna E. Frid: A Unique Decomposition Theorem for Factorial Languages. IJAC 15(1): 149-160 (2005)
	2004
8		Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva: The Classification of Some Perfect Codes. Des. Codes Cryptography 31(3): 313-318 (2004)
	2002
7		Sergey V. Avgustinovich, Anna E. Frid: Words Avoiding Abelian Inclusions. Journal of Automata, Languages and Combinatorics 7(1): 3-9 (2002)
	2001
6		Sergey V. Avgustinovich: Perfect binary (n, 3) codes: the structure of graphs of minimum distances. Discrete Applied Mathematics 114(1-3): 9-11 (2001)
5		Sergey V. Avgustinovich, Faina I. Solov'eva: On the metrical rigidity of binary codes. Electronic Notes in Discrete Mathematics 6: 444-451 (2001)
4		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
3		Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid: Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics 2000: 51-62
2		Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass: Cartesian Products of Graphs and Metric Spaces. Eur. J. Comb. 21(7): 847-851 (2000)
	1992
1		Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov: Vector Summation within Minimal Angle. Comput. Geom. 2: 235-239 (1992)

Coauthor Index

1	Julien Cassaigne	[11]
2	Dmitry Fon-Der-Flaass	[2] [3]
3	Anna E. Frid	[3] [7] [9] [11] [13] [21]
4	Amy Glen	[20]
5	Bjarni V. Halldórsson	[20]
6	Olof Heden	[8]
7	T. Kamae	[21]
8	Sergey Kitaev	[16] [20]
9	Denis S. Krotov	[15] [17] [18]
10	Antoine Lobstein	[4]
11	Ivan Mogilnykh	[19]
12	Svetlana Puzynina (S. A. Puzynina)	[14]
13	P. Salimov	[21]
14	Sergey Vasil'evich Sevast'janov	[1]
15	Faina I. Solov'eva	[4] [5] [8]
16	Yuriy Vasil'ev	[18]
17	Anastasia Yu. Vasil'eva	[10] [12]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page