Sergey V. Avgustinovich

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:35/674 · DBLP profile ↗

← Back

15ranked-venue papers

12as first author

0since 2021 · last 2019

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 9 first-authorSecurity and privacy · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

2 papers

Coding theory · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Coding theory › error-correcting codes perfect codes	0.1	2	2008	On the Number of 1-Perfect Binary Codes: A Lower Bound · IEEE Trans. Inf. Theory 2008 Intersection matrices for partitions by binary perfect codes · IEEE Trans. Inf. Theory 2001
Coding theory › error-correcting codes › perfect codes binary perfect code	0.1	1	2008	On the Number of 1-Perfect Binary Codes: A Lower Bound · IEEE Trans. Inf. Theory 2008
Coding theory › error-correcting codes hamming space	0.0	1	2001	Intersection matrices for partitions by binary perfect codes · IEEE Trans. Inf. Theory 2001

Methods — techniques the papers use, named apart from their topics

code construction · 0.1combinatorial enumeration · 0.0

Year	Publication	Venue	Position
2019	On abelian saturated infinite words Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela	Theor. Comput. Sci.	1
2016	Weak Abelian Periodicity of Infinite Words Sergey V. Avgustinovich, Svetlana Puzynina	Theory Comput. Syst.	1
2016	Gray coding cubic planar maps Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki	Theor. Comput. Sci.	1
2015	Ergodic Infinite Permutations of Minimal Complexity Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina	DLT	1
2013	Avoidance of boxed mesh patterns on permutations Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich	Discret. Appl. Math.	1
2011	Infinite permutations of lowest maximal pattern complexity Sergey V. Avgustinovich, Anna E. Frid, Teturo Kamae, Pavel Salimov	Theor. Comput. Sci.	1
2010	On shortest crucial words avoiding abelian powers Sergey V. Avgustinovich, Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev	Discret. Appl. Math.	1
2008	On periodicity of two-dimensional words Svetlana Puzynina, Sergey V. Avgustinovich	Theor. Comput. Sci.	2
2008	On the Number of 1-Perfect Binary Codes: A Lower Bound abstract We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight. Denis S. Krotov, Sergey V. Avgustinovich	IEEE Trans. Inf. Theory	2
2006	On Intersection Problem for Perfect Binary Codes Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva	Des. Codes Cryptogr.	1
2004	The Classification of Some Perfect Codes Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva	Des. Codes Cryptogr.	1
2001	Perfect binary (n, 3) codes: the structure of graphs of minimum distances Sergey V. Avgustinovich	Discret. Appl. Math.	1
2001	Intersection matrices for partitions by binary perfect codes abstract We investigate the following problem: given two partitions of the Hamming space, their intersection matrix provides the cardinalities of the pairwise intersections of the subsets of these partitions. If we consider partitions by extended perfect codes, how many intersection matrices can we construct?. Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva	IEEE Trans. Inf. Theory	1
1998	On Bispecial Words and Subword Complexity of DOL Sequences Anna E. Frid, Sergey V. Avgustinovich	SETA	2
1992	Vector Summation within Minimal Angle Sergey V. Avgustinovich, Sergey Sevastyanov	Comput. Geom.	1