EDBT 2026 Demo / reviewers in the wild / expert
Reid Barton
dblp:158/2231
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 2 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 |
Automated reasoning and model checking · 67% Computational geometry · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry
algebraic geometry |
1.0 | 1 | 2026 | A Computer Formalisation of the Serre Finiteness Theorem · LICS 2026 |
Automated reasoning and model checking
automated reasoning |
1.0 | 1 | 2026 | A Computer Formalisation of the Serre Finiteness Theorem · LICS 2026 |
Automated reasoning and model checking › theorem proving
formal proof |
1.0 | 1 | 2026 | A Computer Formalisation of the Serre Finiteness Theorem · LICS 2026 |
Methods — techniques the papers use, named apart from their topics
proof assistant · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Computer Formalisation of the Serre Finiteness Theorem
Reid Barton, Axel Ljungström, Owen Milner, Anders Mörtberg |
LICS | 1 |
| 2025 | A short proof of the Frobenius property for generic fibrationsabstractAbstract We give a simple diagrammatic proof of the Frobenius property for generic fibrations that does not depend on any additional structure on the interval object such as connections. Reid Barton |
Math. Struct. Comput. Sci. | 1 |