EDBT 2026 Demo / reviewers in the wild / expert
Yaroslav Shitov 0001
dblp:128/3935 · also Yaroslav N. Shitov
· DBLP profile ↗
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
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 |
Quantum computing and quantum information · 91% Combinatorics and discrete mathematics · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information
quantum channel |
0.4 | 1 | 2019 | Quantum Version of Wielandt's Inequality Revisited · IEEE Trans. Inf. Theory 2019 |
Quantum computing and quantum information
quantum information theory |
0.4 | 1 | 2019 | Quantum Version of Wielandt's Inequality Revisited · IEEE Trans. Inf. Theory 2019 |
Quantum computing and quantum information
wielandt inequality |
0.4 | 1 | 2019 | Quantum Version of Wielandt's Inequality Revisited · IEEE Trans. Inf. Theory 2019 |
Combinatorics and discrete mathematics
matrix theory |
0.1 | 1 | 2019 | Quantum Version of Wielandt's Inequality Revisited · IEEE Trans. Inf. Theory 2019 |
Methods — techniques the papers use, named apart from their topics
combinatorial bounds · 0.4asymptotic analysis · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 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 RevisitedabstractConsider 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. Theory | 2 |
| 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 |