EDBT 2026 Demo / reviewers in the wild / expert
Erika De Benedetti
dblp:132/9259
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-author
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
2 papers |
Logic in computer science · 59% Computational complexity · 41% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
implicit computational complexity |
0.3 | 1 | 2018 | Characterizing polynomial and exponential complexity classes in elementary lambda-calculus · Inf. Comput. 2018 |
Logic in computer science
lambda calculus |
0.3 | 1 | 2018 | Characterizing polynomial and exponential complexity classes in elementary lambda-calculus · Inf. Comput. 2018 |
Logic in computer science
type theory |
0.2 | 1 | 2016 | A type assignment for λ-calculus complete both for FPTIME and strong normalization · Inf. Comput. 2016 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca |
Inf. Comput. | 2 |
| 2016 | A type assignment for λ-calculus complete both for FPTIME and strong normalization
Erika De Benedetti, Simona Ronchi Della Rocca |
Inf. Comput. | 1 |