Douglas S. Bridges Constructive Mathematics: A Foundation for Computable Analysis. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:219, n:1-2, pp:95-109 [Journal]
Armin Hemmerling On Approximate and Algebraic Computability over the Real Numbers. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:219, n:1-2, pp:185-223 [Journal]
Marian Boykan Pour-El From Axiomatics to Intrinsic Characterization: Some Open Problems in Computable Analysis. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:219, n:1-2, pp:319-329 [Journal]
Klaus Weihrauch Computability on the Probability Measureson the Borel Sets of the Unit Interval. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:219, n:1-2, pp:421-437 [Journal]
Henryk Wozniakowski Why Does Information-Based Complexity Use the Real Number Model? [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:219, n:1-2, pp:451-465 [Journal]
Ning Zhong Computability Structure of the Sobolev Spaces and Its Applications. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:219, n:1-2, pp:487-510 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP