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

Olga Ratseeva

dblp:352/5276 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Theory of computation · 1 · 1 since 2021

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
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity › fine-grained complexity
conditional lower bounds		 0.812024
Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds · SODA 2024
Computational complexity
fine-grained complexity		 0.812024
Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds · SODA 2024
Computational complexity › fine-grained complexity › conditional lower bounds
SETH-based lower bounds		 0.812024
Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds · SODA 2024

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

reduction · 0.8
YearPublicationVenuePosition
2024 Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds
abstract
The field of fine-grained complexity aims at proving conditional lower bounds on the time complexity of computational problems. One of the most popular and successfully used assumptions, Strong Exponential Time Hypothesis (SETH), implies that SAT cannot be solved in 2(1-ɛ)n time. In recent years, it has been proved that known algorithms for many problems are optimal under SETH. Despite the wide applicability of SETH, for many problems, there are no known SETH-based lower bounds, so the quest for new reductions continues.
Tatiana Belova, Alexander S. Kulikov, Ivan Mihajlin, Olga Ratseeva, Grigory Reznikov, Denil Sharipov
 SODA4