Demo Data from EDBT 2026 / reviewers in the wild / expert
Andreas Flögel
dblp:95/6011
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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 |
Computational complexity · 50% Automated reasoning and model checking · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking › satisfiability
quantified boolean formula |
0.0 | 1 | 1995 | Resolution for Quantified Boolean Formulas · Inf. Comput. 1995 |
Computational complexity › proof complexity
resolution |
0.0 | 1 | 1995 | Resolution for Quantified Boolean Formulas · Inf. Comput. 1995 |
Methods — techniques the papers use, named apart from their topics
resolution · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Resolution for Quantified Boolean Formulas
Hans Kleine Büning, Marek Karpinski, Andreas Flögel |
Inf. Comput. | 3 |