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 VLDB 2026 / reviewers in the wild / expert

Pavel Martyugin

dblp:07/5192 · also Pavel V. Martugin, Pavel V. Martyugin · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2016
0000-0002-5433-1599ORCID · verified

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

Theory of computation · 7 · 6 first-authorSoftware engineering, systems software and programming languages · 1

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
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › finite automata
synchronizing automata		 0.112008
A series of slowly synchronizing automata with a zero state over a small alphabet · Inf. Comput. 2008
Automata and formal languages
finite automata		 0.012008
A series of slowly synchronizing automata with a zero state over a small alphabet · Inf. Comput. 2008
YearPublicationVenuePosition
2016 Synchronizing Automata over Nested Words
Dmitry Chistikov 0001, Pavel Martyugin, Mahsa Shirmohammadi
 FoSSaCS2
2014 Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata
Pavel Martyugin
 Theory Comput. Syst.1
2012 Synchronization of Automata with One Undefined or Ambiguous Transition
Pavel Martyugin
 CIAA1
2012 Complexity of problems concerning reset words for cyclic and Eulerian automata
Pavel Martyugin
 Theor. Comput. Sci.1
2011 Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata
Pavel Martyugin
 CIAA1
2008 A series of slowly synchronizing automata with a zero state over a small alphabet
Pavel Martyugin
 Inf. Comput.1
2007 A series of slowly synchronizable automata with a zero state over a small alphabet
Pavel Martyugin
 LATA1