default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNing Zhong 0002
Person information
- affiliation: University of Cincinnati, OH, USA
Other persons with the same name
- Ning Zhong — disambiguation page
- Ning Zhong 0001
![[0000-0001-7882-8340]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-7882-8340")
— Maebashi Institute of Technology, Maebashi, Japan (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j26]Daniel Silva Graça, Ning Zhong:
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. Comput. 12(2): 117-144 (2023)- 2021
- [j25]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) - 2015
- [j24]I. Pour-El, Ning Zhong:
A Tribute to Marian Boykan Pour-El (1928-2009). J. Log. Comput. 25(4): 1133-1140 (2015) - [j23]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) - [j22]Shu-Ming Sun, Ning Zhong:
Computability aspects for 1st-order partial differential equations via characteristics. Theor. Comput. Sci. 583: 27-39 (2015) - 2014
- [j21]Shu-Ming Sun, Ning Zhong:
On Effective Convergence of Numerical Solutions for Differential Equations. ACM Trans. Comput. Theory 6(1): 4:1-4:25 (2014) - 2012
- [j20]Daniel Silva Graça, Ning Zhong, Jorge Buescu:
Computability, noncomputability, and hyperbolic systems. Appl. Math. Comput. 219(6): 3039-3054 (2012) - [j19]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) - 2011
- [j18]Daniel Silva Graça, Ning Zhong:
Computability in planar dynamical systems. Nat. Comput. 10(4): 1295-1312 (2011) - 2009
- [j17]Robert Rettinger, Klaus Weihrauch, Ning Zhong:
Topological Complexity of Blowup Problems. J. Univers. Comput. Sci. 15(6): 1301-1316 (2009) - 2008
- [j16]Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong:
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 14(6): 800 (2008) - [j15]Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong:
Editorial: Math. Log. Quart. 5/2008. Math. Log. Q. 54(5): 453 (2008) - 2007
- [j14]Klaus Weihrauch, Ning Zhong:
Computable analysis of the abstract Cauchy problem in a Banach space and its applications I. Math. Log. Q. 53(4-5): 511-531 (2007) - [j13]Ning Zhong:
Computable Analysis of a Boundary-Value Problem for the Korteweg-de Vries Equation. Theory Comput. Syst. 41(1): 155-175 (2007) - 2006
- [j12]Klaus Weihrauch, Ning Zhong:
Computing Schrödinger propagators on Type-2 Turing machines. J. Complex. 22(6): 918-935 (2006) - [j11]Klaus Weihrauch, Ning Zhong:
An Algorithm for Computing Fundamental Solutions. SIAM J. Comput. 35(6): 1283-1294 (2006) - 2005
- [j10]Klaus Weihrauch, Ning Zhong:
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing. Theor. Comput. Sci. 332(1-3): 337-366 (2005) - 2004
- [j9]Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong:
Preface: MLQ - Math. Log. Quart. 4-5/2004. Math. Log. Q. 50(4-5): 327-328 (2004) - 2003
- [j8]Ning Zhong, Klaus Weihrauch:
Computatbility theory of generalized functions. J. ACM 50(4): 469-505 (2003) - 2002
- [j7]Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong:
Preface: MLQ - Math. Log. Quart. Supplement 1/2002. Math. Log. Q. 48(S1) (2002) - 2001
- [j6]William Gay, Bing-Yu Zhang, Ning Zhong:
Computability of Solutions of the Korteweg-de Vries Equation. Math. Log. Q. 47(1): 93-110 (2001) - 1999
- [j5]Bing-Yu Zhang, Ning Zhong:
Lp-Computability. Math. Log. Q. 45: 449-456 (1999) - [j4]Ning Zhong:
Computability Structure of the Sobolev Spaces and Its Applications. Theor. Comput. Sci. 219(1-2): 487-510 (1999) - 1998
- [j3]Ning Zhong:
Derivatives of Computable Functions. Math. Log. Q. 44: 304-316 (1998) - [j2]Ning Zhong:
Recursively Enumerable Subsets of Rq in Two Computing Models: Blum-Shub-Smale Machine and Turing Machine. Theor. Comput. Sci. 197(1-2): 79-94 (1998) - 1997
- [j1]Marian Boykan Pour-El, Ning Zhong:
The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable. Math. Log. Q. 43: 499-509 (1997)
Conference and Workshop Papers
- 2021
- [c18]Daniel Silva Graça, Ning Zhong:
Computability of Limit Sets for Two-Dimensional Flows. CiE 2021: 494-503 - 2020
- [c17]Shu-Ming Sun, Ning Zhong, Martin Ziegler:
Computability of the Solutions to Navier-Stokes Equations via Effective Approximation. Complexity and Approximation 2020: 80-112 - 2018
- [c16]Daniel Silva Graça, Ning Zhong:
Computability of Ordinary Differential Equations. CiE 2018: 204-213 - 2015
- [c15]Shu-Ming Sun, Ning Zhong, Martin Ziegler:
On Computability of Navier-Stokes' Equation. CiE 2015: 334-342 - 2013
- [c14]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 - 2009
- [c13]Ning Zhong:
Computable Analysis of Differential Equations (Invited Talk). CCA 2009 - [c12]Daniel Silva Graça, Ning Zhong:
Computing Domains of Attraction for Planar Dynamics. UC 2009: 179-190 - 2008
- [c11]Robert Rettinger, Klaus Weihrauch, Ning Zhong:
Complexity of Blowup Problems: Extended Abstract. CCA 2008: 219-230 - 2007
- [c10]Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Preface. CCA 2007: 1-2 - 2006
- [c9]Klaus Weihrauch, Ning Zhong:
Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable? TAMC 2006: 783-792 - [c8]Klaus Weihrauch, Ning Zhong:
Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I). CCA 2006: 33-59 - 2005
- [c7]Ning Zhong:
Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation. CiE 2005: 552-561 - 2004
- [c6]Klaus Weihrauch, Ning Zhong:
An Algorithm for Computing Fundamental Solutions. CCA 2004: 201-215 - 2002
- [c5]Klaus Weihrauch, Ning Zhong:
The Solution Operator of the Korteweg-de Vries Equation is Computable. CCA 2002: 189-201 - 2001
- [c4]Klaus Weihrauch, Ning Zhong:
Turing Computability of a Nonlinear Schrödinger Propagator. COCOON 2001: 596-600 - 2000
- [c3]Klaus Weihrauch, Ning Zhong:
Is the Linear Schrödinger Propagator Turing Computable? CCA 2000: 369-377 - 1999
- [c2]Klaus Weihrauch, Ning Zhong:
The Wave Propagator Is Turing Computable. ICALP 1999: 697-707 - 1996
- [c1]Marian Boykan Pour-El, Ning Zhong:
The Wave Equation with Computable Initial Data Whose Unique Solution is Nowhere Computable. CCA 1996
Editorship
- 2010
- [e2]Xizhong Zheng, Ning Zhong:
Proceedings Seventh International Conference on Computability and Complexity in Analysis, CCA 2010, Zhenjiang, China, 21-25th June 2010. EPTCS 24, 2010 [contents] - 2008
- [e1]Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, CCA 2007, Siena, Italy, June 16-18, 2007. Electronic Notes in Theoretical Computer Science 202, Elsevier 2008 [contents]
Informal and Other Publications
- 2021
- [i5]Daniel Silva Graça, Ning Zhong:
Computing the exact number of periodic orbits for planar flows. CoRR abs/2101.07701 (2021) - [i4]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) - [i3]Daniel Silva Graça, Ning Zhong:
Robustness of non-computability. CoRR abs/2109.15080 (2021) - 2020
- [i2]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) - 2017
- [i1]Daniel Silva Graça, Cristobal Rojas, Ning Zhong:
Computing geometric Lorenz attractors with arbitrary precision. CoRR abs/1702.04059 (2017)
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-12-10 21:48 CET 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:
