default search action
Stefano Galatolo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Fadi Antown, Gary Froyland
, Stefano Galatolo
Optimal Linear Response for Markov Hilbert-Schmidt Integral Operators and Stochastic Dynamical Systems. J. Nonlinear Sci. 32(6): 79 (2022) - [i4]Stefano Galatolo, Maurizio Monge, Isaia Nisoli, Federico Poloni:
A general framework for the rigorous computation of invariant densities and the coarse-fine strategy. CoRR abs/2212.05017 (2022)
2010 – 2019
- 2019
- [j10]Luigi Marangio, Stefano Galatolo, Leone Fronzoni, Santi Chillemi, Angelo Di Garbo:
Phase-locking patterns in a resonate and fire neural model with periodic drive. Biosyst. 184 (2019) - 2018
- [j9]Mohammed Bakiri
A Hardware and Secure Pseudorandom Generator for Constrained Devices. IEEE Trans. Ind. Informatics 14(8): 3754-3765 (2018) - 2014
- [j8]Vitor Araújo, Stefano Galatolo, Maria José Pacifico:
Statistical Properties of Lorenz-like Flows, Recent Developments and Perspectives. Int. J. Bifurc. Chaos 24(10) (2014) - [j7]Stefano Galatolo, Isaia Nisoli
Probability, statistics and computation in dynamical systems. Math. Struct. Comput. Sci. 24(3) (2014) - [j6]Stefano Galatolo, Isaia Nisoli
An Elementary Approach to Rigorous Approximation of Invariant Measures. SIAM J. Appl. Dyn. Syst. 13(2): 958-985 (2014) - 2011
- [i3]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas:
Dynamical systems, simulation, abstract computation. CoRR abs/1101.0833 (2011) - 2010
- [j5]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Inf. Comput. 208(1): 23-41 (2010) - [j4]Lucio M. Calcagnile, Stefano Galatolo, Giulia Menconi
Non-sequential Recursive Pair Substitutions and Numerical Entropy Estimates in Symbolic Dynamical Systems. J. Nonlinear Sci. 20(6): 723-745 (2010) - [c2]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems. CCA 2010: 7-18
2000 – 2009
- 2009
- [j3]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties. Theor. Comput. Sci. 410(21-23): 2207-2222 (2009) - 2008
- [i2]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas:
Algorithmically random points in measure preserving systems, statistical behaviour, complexity and entropy. CoRR abs/0801.0209 (2008) - 2007
- [i1]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas:
An effective Borel-Cantelli Lemma. Constructing orbits with required statistical properties. CoRR abs/0711.1478 (2007) - 2006
- [c1]Vieri Benci
Optimal Information Measures for Weakly Chaotic Dynamical Systems. GTIT-C 2006: 614-627 - 2005
- [j2]Vieri Benci
Optimal information measures for weakly chaotic dynamical systems. Electron. Notes Discret. Math. 21: 241-242 (2005) - 2000
- [j1]Stefano Galatolo:
A proof of the Beyer-Stein-Ulam relation between complexity and entropy. Discret. Math. 223(1-3): 367-372 (2000)
Coauthor Index
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-25 05:57 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: