VLDB 2026 Research / reviewers in the wild / expert

Yaroslav Shitov 0001

dblp:128/3935 · also Yaroslav N. Shitov · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
1since 2021 · last 2026
0000-0002-2264-083XORCID · verified

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

Theory of computation · 5 · 4 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
YearPublicationVenuePosition
2026 On the complexity of a problem related to set cover
Yaroslav Shitov 0001
 Theor. Comput. Sci.1
2020 Factoring a band matrix over a semiring
Yaroslav Shitov 0001
 Fuzzy Sets Syst.1
2019 Euclidean Distance Matrices and Separations in Communication Complexity Theory
Yaroslav Shitov 0001
 Discret. Comput. Geom.1
2019 Quantum Version of Wielandt's Inequality Revisited
abstract
Consider a linear space L of complex D-dimensional linear operators and assume that some power Lk of L is the whole set End(CD). Perez-Garcia, Verstraete, Wolf, and Cirac conjectured that the sequence L1, L2, . .. stablilizes after O(D2) terms; we prove that this happens after O(D2log D) terms, improving the previously known bound of O(D4).
Mateusz Michalek, Yaroslav Shitov 0001
 IEEE Trans. Inf. Theory2
2018 On the complexity of graph coloring with additional local conditions
Yaroslav Shitov 0001
 Inf. Process. Lett.1
2017 On the complexity of failed zero forcing
Yaroslav Shitov 0001
 Theor. Comput. Sci.1
2017 A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length
Yaroslav Shitov 0001
 Theor. Comput. Sci.1