Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Silva Graça
Person information
- affiliation: University of Algarve, Faro, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]Daniel Silva Graça
, Ning Zhong:
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable. Theor. Comput. Sci. 895: 48-54 (2021)- [c12]Daniel Silva Graça, Ning Zhong:
Computability of Limit Sets for Two-Dimensional Flows. CiE 2021: 494-503 - [i12]Daniel Silva Graça, Ning Zhong:
Computing the exact number of periodic orbits for planar flows. CoRR abs/2101.07701 (2021) - [i11]Daniel Silva Graça, Ning Zhong:
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. CoRR abs/2109.15073 (2021) - [i10]Daniel Silva Graça, Ning Zhong:
Robustness of non-computability. CoRR abs/2109.15080 (2021) - 2020
- [i9]Daniel Silva Graça, Ning Zhong:
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable. CoRR abs/2002.08199 (2020)
2010 – 2019
- 2018
- [c11]Daniel Silva Graça, Ning Zhong:
Computability of Ordinary Differential Equations. CiE 2018: 204-213 - 2017
- [j18]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the functions generated by the general purpose analog computer. Inf. Comput. 257: 34-57 (2017) - [j17]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. J. ACM 64(6): 38:1-38:76 (2017) - [i8]Daniel Silva Graça, Cristobal Rojas, Ning Zhong:
Computing geometric Lorenz attractors with arbitrary precision. CoRR abs/1702.04059 (2017) - 2016
- [j16]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Computing with polynomial ordinary differential equations. J. Complex. 36: 106-140 (2016) - [j15]Amaury Pouly, Daniel Silva Graça:
Computational complexity of solving polynomial differential equations over unbounded domains. Theor. Comput. Sci. 626: 67-82 (2016) - [c10]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations. ICALP 2016: 109:1-109:15 - [i7]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. CoRR abs/1601.05360 (2016) - [i6]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Computing with Polynomial Ordinary Differential Equations. CoRR abs/1601.05683 (2016) - [i5]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the Functions Generated by the General Purpose Analog Computer. CoRR abs/1602.00546 (2016) - [i4]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR abs/1609.08059 (2016) - 2015
- [j14]Daniel Silva Graça, Ning Zhong:
An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable. Theory Comput. Syst. 57(2): 478-520 (2015) - [c9]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. MACIS 2015: 469-473 - 2014
- [i3]Amaury Pouly, Daniel Silva Graça:
Computational complexity of solving elementary differential equations over unbounded domains. CoRR abs/1409.0451 (2014) - 2013
- [j13]Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry:
Computation with perturbed dynamical systems. J. Comput. Syst. Sci. 79(5): 714-724 (2013) - [c8]Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong:
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. CiE 2013: 12-21 - [c7]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC 2013: 169-180 - 2012
- [j12]Daniel Silva Graça, Ning Zhong, Jorge Buescu:
Computability, noncomputability, and hyperbolic systems. Appl. Math. Comput. 219(6): 3039-3054 (2012) - [j11]Daniel Silva Graça:
Noncomputability, unpredictability, and financial markets. Complex. 17(6): 24-30 (2012) - [j10]Daniel Silva Graça, Ning Zhong, H. S. Dumas:
The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited. Theor. Comput. Sci. 457: 101-110 (2012) - [c6]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the complexity of solving initial value problems. ISSAC 2012: 115-121 - [i2]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the complexity of solving initial value problems. CoRR abs/1202.4407 (2012) - [i1]Amaury Pouly, Olivier Bournez, Daniel Silva Graça:
Turing machines can be efficiently simulated by the General Purpose Analog Computer. CoRR abs/1203.4667 (2012) - 2011
- [j9]Daniel Silva Graça, Ning Zhong:
Computability in planar dynamical systems. Nat. Comput. 10(4): 1295-1312 (2011) - [c5]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS 2011: 170-181 - 2010
- [c4]Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry:
Robust Computations with Dynamical Systems. MFCS 2010: 198-208
2000 – 2009
- 2009
- [j8]Daniel Silva Graça, Jorge Buescu, Manuel Lameiras Campagnolo:
Computational bounds on polynomial differential equations. Appl. Math. Comput. 215(4): 1375-1385 (2009) - [j7]Pieter Collins, Daniel Silva Graça:
Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach. J. Univers. Comput. Sci. 15(6): 1162-1185 (2009) - [c3]Daniel Silva Graça, Ning Zhong:
Computing Domains of Attraction for Planar Dynamics. UC 2009: 179-190 - 2008
- [j6]Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu:
Computability with polynomial differential equations. Adv. Appl. Math. 40(3): 330-349 (2008) - [j5]Daniel Silva Graça, Jorge Buescu, Manuel Lameiras Campagnolo:
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs. Electron. Notes Theor. Comput. Sci. 202: 49-57 (2008) - [j4]Pieter Collins, Daniel Silva Graça:
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach. Electron. Notes Theor. Comput. Sci. 221: 103-114 (2008) - 2007
- [j3]Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry:
Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complex. 23(3): 317-335 (2007) - 2006
- [c2]Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry:
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC 2006: 631-643 - 2005
- [c1]Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu:
Robust Simulations of Turing Machines with Analytic Maps and Flows. CiE 2005: 169-179 - 2004
- [j2]Daniel Silva Graça:
Some recent developments on Shannon's General Purpose Analog Computer. Math. Log. Q. 50(4-5): 473-485 (2004) - 2003
- [j1]Daniel Silva Graça, José Félix Costa:
Analog computers and recursive functions over the reals. J. Complex. 19(5): 644-664 (2003)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-06-25 01:14 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:
