Demo Data from VLDB 2026 / reviewers in the wild / expert
Timur Bakibayev
dblp:55/8171
· DBLP profile ↗
5ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-5357-1099ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5
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 |
Logic in computer science · 67% Algorithms and data structures · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › completeness
completeness notions |
0.1 | 1 | 2010 | Weak Completeness Notions for Exponential Time · ICALP (1) 2010 |
Algorithms and data structures › exact algorithms
exponential time algorithms |
0.1 | 1 | 2010 | Weak Completeness Notions for Exponential Time · ICALP (1) 2010 |
Logic in computer science › completeness
weak completeness |
0.1 | 1 | 2010 | Weak Completeness Notions for Exponential Time · ICALP (1) 2010 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Weak Completeness Notions for Exponential Time
Klaus Ambos-Spies, Timur Bakibayev |
Theory Comput. Syst. | 2 |
| 2013 | Nontriviality for exponential time w.r.t. weak reducibilities
Klaus Ambos-Spies, Timur Bakibayev |
Theor. Comput. Sci. | 2 |
| 2012 | Comparing Nontriviality for E and EXP
Klaus Ambos-Spies, Timur Bakibayev |
Theory Comput. Syst. | 2 |
| 2010 | Weak Completeness Notions for Exponential Time
Klaus Ambos-Spies, Timur Bakibayev |
ICALP (1) | 2 |
| 2010 | Nontriviality for Exponential Time w.r.t. Weak Reducibilities
Klaus Ambos-Spies, Timur Bakibayev |
TAMC | 2 |