default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Mazzanti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j14]Stefano Mazzanti
:
New substitution bases for complexity classes. Math. Log. Q. 66(1): 37-50 (2020)
2010 – 2019
- 2016
- [j13]Stefano Mazzanti:
Regressive computations characterize logarithmic space. Inf. Comput. 251: 16-35 (2016) - 2015
- [j12]Stefano Mazzanti:
Bases for AC0 and Other Complexity Classes. Fundam. Informaticae 136(4): 433-460 (2015) - [c6]Stefano Mazzanti:
Unbounded Recursion and Non-size-increasing Functions. ICTCS 2015: 197-210 - 2014
- [c5]Stefano Mazzanti:
Logspace computability and regressive machines. ICTCS 2014: 285-289 - 2013
- [j11]Stefano Mazzanti:
Iteration on notation and unary functions. Math. Log. Q. 59(6): 415-434 (2013) - 2012
- [j10]Stefano Mazzanti:
CRN Elimination and Substitution Bases for Complexity Classes. Fundam. Informaticae 120(1): 29-58 (2012)
2000 – 2009
- 2005
- [b1]Stefano Mazzanti:
Progetto, realizzazione e sperimentazione di un sistema di acquisizione dati in tempo reale su piattaforma personal computer. University of Florence, Italy, 2005 - [j9]Stefano Mazzanti:
Bounded iteration and unary functions. Math. Log. Q. 51(1): 89-94 (2005) - 2003
- [j8]G. M. Germano, Stefano Mazzanti:
Cantor Diagrams: A Unifying Discussion of Self-Reference. Appl. Categorical Struct. 11(4): 313-336 (2003) - [c4]Giorgio Germano, Stefano Mazzanti:
Peano Structures and the Semantics of Iteration. COMETA 2003: 149-162 - 2002
- [j7]Stefano Mazzanti:
Plain Bases for Classes of Primitive Recursive Functions. Math. Log. Q. 48(1): 93-104 (2002) - 2001
- [j6]G. M. Germano, Stefano Mazzanti:
Non-Deterministic Closure Theory and Universal Arrows. Appl. Categorical Struct. 9(4): 339-364 (2001)
1990 – 1999
- 1997
- [j5]Stefano Mazzanti:
Iterative Characterizations of Computable Unary Functions: A General Method. Math. Log. Q. 43: 29-38 (1997) - [c3]Egon Börger, Stefano Mazzanti:
A Practical Method for Rigorously Controllable Hardware Design. ZUM 1997: 151-187 - 1995
- [j4]Stefano Mazzanti:
Succinct Iterative Characterizations of Primitive Computable Unary Functions. Inf. Process. Lett. 56(6): 315-319 (1995) - 1991
- [j3]Giorgio Germano, Stefano Mazzanti:
General Iteration and Unary Functions. Ann. Pure Appl. Log. 54(2): 137-178 (1991) - [j2]Giorgio Germano, Stefano Mazzanti:
Closure Functions and General Iterates as Reflectors. Theor. Comput. Sci. 82(2): 215-252 (1991)
1980 – 1989
- 1988
- [j1]G. M. Germano, Stefano Mazzanti:
Primitive iteration and unary functions. Ann. Pure Appl. Log. 40(3): 217-256 (1988) - 1987
- [c2]Giorgio Germano, Stefano Mazzanti:
A Setting for Generalized Computability. Computation Theory and Logic 1987: 154-165 - [c1]Giorgio Germano, Stefano Mazzanti:
Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration. CSL 1987: 64-80
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
