Journals in DBLP

Theor. Comput. Sci.
2002, volume: 284, number: 2

1. Ker-I Ko, Anil Nerode, Klaus Weihrauch
   Foreword. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:197- [Journal]
   
2. Markus Bläser
   Uniform computational complexity of the derivatives of C^infinity-functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:199-206 [Journal]
   
3. Jens Blanck, Viggo Stoltenberg-Hansen, J. V. Tucker
   Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:207-240 [Journal]
   
4. Vasco Brattka, Peter Hertling
   Topological properties of real number representations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:241-257 [Journal]
   
5. Douglas S. Bridges, Nicholas Dudley Ward
   Kernels of seminorms in constructive analysis. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:259-267 [Journal]
   
6. Cristian Calude
   Chaitin Omega numbers, Solovay machines, and Gödel incompleteness. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:269-277 [Journal]
   
7. Douglas A. Cenzer, Jeffrey B. Remmel
   Effectively closed sets and graphs of computable real functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:279-318 [Journal]
   
8. Abbas Edalat, André Lieutier
   Foundation of a computable solid modelling. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:319-345 [Journal]
   
9. Armin Hemmerling
   Effective metric spaces and representations of the reals. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:2, pp:347-372 [Journal]
   
10. Michal Konecný
    Real functions computable by finite automata using affine representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:373-396 [Journal]
    
11. Vladimir Krupski
    Effective simultaneous approximability of reals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:397-417 [Journal]
    
12. Takakazu Mori
    On the computability of Walsh functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:419-436 [Journal]
    
13. Dag Normann
    Exact real number computations relative to hereditarily total functionals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:437-453 [Journal]
    
14. Ludwig Staiger
    The Kolmogorov complexity of real numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:455-466 [Journal]
    
15. Hideki Tsuiki
    Real number computation through Gray code embedding. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:467-485 [Journal]
    
16. Atsushi Yoshikawa
    Interpolation functor and computability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:487-498 [Journal]
    
17. Xizhong Zheng
    The closure properties on real numbers under limits and computable operators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:499-518 [Journal]
    
18. Matthias Schröder
    Extended admissibility. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:519-538 [Journal]
    
19. Rodney G. Downey, Geoffrey LaForte
    Presentations of computably enumerable reals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:539-555 [Journal]