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 VLDB 2026 / reviewers in the wild / expert

Paolo Parisen Toldin

dblp:10/10967 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2015
—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% Algorithms and data structures · 50%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
polynomial-time algorithms		 0.212015
A higher-order characterization of probabilistic polynomial time · Inf. Comput. 2015
Computational complexity
randomized computation		 0.212015
A higher-order characterization of probabilistic polynomial time · Inf. Comput. 2015

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

higher-order characterization · 0.2
YearPublicationVenuePosition
2015 A higher-order characterization of probabilistic polynomial time
Ugo Dal Lago, Paolo Parisen Toldin
 Inf. Comput.2