Stefano Mazzanti

According to our database, Stefano Mazzanti authored at least 21 papers between 1987 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

New substitution bases for complexity classes.

Stefano Mazzanti

Math. Log. Q., 2020

2016

Regressive computations characterize logarithmic space.

Stefano Mazzanti

Inf. Comput., 2016

2015

Bases for AC⁰ and Other Complexity Classes.

Stefano Mazzanti

Fundam. Informaticae, 2015

Unbounded Recursion and Non-size-increasing Functions.

Stefano Mazzanti

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

2014

Logspace computability and regressive machines.

Stefano Mazzanti

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

Iteration on notation and unary functions.

Stefano Mazzanti

Math. Log. Q., 2013

2012

CRN Elimination and Substitution Bases for Complexity Classes.

Stefano Mazzanti

Fundam. Informaticae, 2012

2005

Progetto, realizzazione e sperimentazione di un sistema di acquisizione dati in tempo reale su piattaforma personal computer.

Stefano Mazzanti

PhD thesis, 2005

Bounded iteration and unary functions.

Stefano Mazzanti

Math. Log. Q., 2005

2003

Peano Structures and the Semantics of Iteration.

Giorgio Germano, Stefano Mazzanti

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Cantor Diagrams: A Unifying Discussion of Self-Reference.

G. M. Germano, Stefano Mazzanti

Appl. Categorical Struct., 2003

2002

Plain Bases for Classes of Primitive Recursive Functions.

Stefano Mazzanti

Math. Log. Q., 2002

2001

Non-Deterministic Closure Theory and Universal Arrows.

G. M. Germano, Stefano Mazzanti

Appl. Categorical Struct., 2001

1997

Iterative Characterizations of Computable Unary Functions: A General Method.

Stefano Mazzanti

Math. Log. Q., 1997

A Practical Method for Rigorously Controllable Hardware Design.

Egon Börger, Stefano Mazzanti

Proceedings of the ZUM '97: The Z Formal Specification Notation, 1997

1995

Succinct Iterative Characterizations of Primitive Computable Unary Functions.

Stefano Mazzanti

Inf. Process. Lett., 1995

1991

Closure Functions and General Iterates as Reflectors.

Giorgio Germano, Stefano Mazzanti

Theor. Comput. Sci., 1991

General Iteration and Unary Functions.

Giorgio Germano, Stefano Mazzanti

Ann. Pure Appl. Log., 1991

1988

Primitive iteration and unary functions.

G. M. Germano, Stefano Mazzanti

Ann. Pure Appl. Log., 1988

1987

Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration.

Giorgio Germano, Stefano Mazzanti

Proceedings of the CSL '87, 1987

A Setting for Generalized Computability.

Giorgio Germano, Stefano Mazzanti

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987