Stefano Mazzanti

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

dblp:22/5043 · DBLP profile ↗

← Back

7ranked-venue papers

4as first author

0since 2021 · last 2016

0000-0001-7923-566XORCID · verified

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

Theory of computation · 7 · 4 first-authorDatabases, data management, data science and information retrieval · 1 · 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

1 paper

Computational complexity · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Computational complexity › space complexity logarithmic space	0.2	1	2016	Regressive computations characterize logarithmic space · Inf. Comput. 2016

Year	Publication	Venue	Position
2016	Regressive computations characterize logarithmic space Stefano Mazzanti	Inf. Comput.	1
2015	Bases for AC0 and Other Complexity Classes abstract Function complexity classes are defined as the substitution closure of finite function sets by improving a method of elimination of concatenation recursion from function algebras. Consequently, the set of AC 0 functions and other canonical complexity classes are defined as the substitution closure of a finite function set. Stefano Mazzanti	Fundam. Informaticae	1
2012	CRN Elimination and Substitution Bases for Complexity Classes abstract Function classes closed with respect to substitution and concatenation recursion on notation are characterized as the substitution closure of finite function sets. Consequently, the sets of TC 0 , NC 1 and L computable functions are characterized as the substitution closure of a finite function set. Stefano Mazzanti	Fundam. Informaticae	1
1995	Succinct Iterative Characterizations of Primitive Computable Unary Functions Stefano Mazzanti	Inf. Process. Lett.	1
1991	General Iteration and Unary Functions Giorgio Germano, Stefano Mazzanti	Ann. Pure Appl. Log.	2
1991	Closure Functions and General Iterates as Reflectors Giorgio Germano, Stefano Mazzanti	Theor. Comput. Sci.	2
1988	Primitive iteration and unary functions G. M. Germano, Stefano Mazzanti	Ann. Pure Appl. Log.	2