The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2006, volume: 351, number: 1

  1. Marc Daumas, Nathalie Revol
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:1- [Journal]
  2. Matthew W. Parker
    Three concepts of decidability for general subsets of uncountable spaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:2-13 [Journal]
  3. Martin Ziegler
    Stability versus speed in a computable algebraic model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:14-26 [Journal]
  4. Xizhong Zheng, Dianchen Lu, Kejin Bao
    Divergence bounded computable real numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:27-38 [Journal]
  5. Alberto Ciaffaglione, Pietro Di Gianantonio
    A certified, corecursive implementation of exact real numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:39-51 [Journal]
  6. Joris van der Hoeven
    Computations with effective real numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:52-60 [Journal]
  7. Jesse Hughes, Milad Niqui
    Admissible digit sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:61-73 [Journal]
  8. Keith Briggs
    Implementing exact real arithmetic in python, C++ and C. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:74-81 [Journal]
  9. M. Hill, I. Robinson
    Quadrature using 64-bit IEEE arithmetic for integrands over [0, 1] with a singularity at 1. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:82-100 [Journal]
  10. Peter Kornerup, Jean-Michel Muller
    Choosing starting values for certain Newton-Raphson iterations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:101-110 [Journal]
  11. Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion
    The design of the Boost interval arithmetic library. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:111-118 [Journal]
  12. Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau
    Using interval arithmetic to prove that a set is path-connected. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:119-128 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002