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.
EDBT 2026 Demo / reviewers in the wild / expert

A. Torrecillas

dblp:09/4233 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3

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 · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity › parallel complexity
p-completeness		 0.011991
Two P-Complete Problems in the Theory of the Reals · ICALP 1991
Computational complexity › computational models
real computation		 0.011991
Two P-Complete Problems in the Theory of the Reals · ICALP 1991
YearPublicationVenuePosition
1992 Two P-complete problems in the theory of the reals
Felipe Cucker, A. Torrecillas
 J. Complex.2
1991 Two P-Complete Problems in the Theory of the Reals
Felipe Cucker, A. Torrecillas
 ICALP2
1991 Average Case Analysis of Unification Algorithms
Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann 0001
 STACS4