EDBT 2026 Demo / reviewers in the wild / expert
Patrick Uftring
dblp:303/4704
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0003-1053-2951ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | The More Gödels, the Better
Patrick Uftring |
CiE | 1 |
| 2023 | Weak and strong versions of Effective Transfinite Recursion
Patrick Uftring |
Ann. Pure Appl. Log. | 1 |
| 2021 | The characterization of Weihrauch Reducibility in Systems containingabstractAbstract We characterize Weihrauch reducibility in $ \operatorname {\mathrm {E-PA^{\omega }}} + \operatorname {\mathrm {QF-AC^{0,0}}}$ and all systems containing it by the provability in a linear variant of the same calculus using modifications of Gödel’s Dialectica interpretation that incorporate ideas from linear logic, nonstandard arithmetic, higher-order computability, and phase semantics. Patrick Uftring |
J. Symb. Log. | 1 |