The SCEAS System
Navigation Menu

Conferences in DBLP

Computability and Complexity in Analysis (CCA) (cca)
2005 (conf/cca/2005)

  1. Masami Hagiya
    Molecular Computing and Real Number Computing. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:- [Conf]
  2. Daisuke Takahashi
    Low Temperature Limit of Equations - Hidden Discrete Structure. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:- [Conf]
  3. Vasco Brattka
    Some Aspects of Computable Functional Analysis. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:- [Conf]
  4. Yohji Akama, Shinji Iizuka
    Real Number Representations of Graph-Directed IFS Attractors. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:3-24 [Conf]
  5. Andrej Bauer, Paul Taylor 0002
    The Dedekind Reals in Abstract Stone Duality. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:25-64 [Conf]
  6. Douglas S. Bridges, Robin Havea, Peter Schuster
    Ideals in Constructive Banach Algebra Theory. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:65-75 [Conf]
  7. Douglas S. Bridges, Luminita Vîta
    An Extension Theorem for Ultraweakly Continuous Linear Functionals on B(X, Y). [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:77-89 [Conf]
  8. Douglas S. Bridges, Luminita Vîta
    Proximal Connectedness. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:91-101 [Conf]
  9. Santiago Figueira, Frank Stephan, Guohua Wu
    Randomness and Universal Machines. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:103-116 [Conf]
  10. Tanja Grubba, Klaus Weihrauch
    A Computable Version of Dini's Theorem for Topological Spaces. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:117-129 [Conf]
  11. Peter Hertling
    A Sequentially Computable Function that is not Effectively Continous at any Point. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:131-148 [Conf]
  12. Hiroyasu Kamo
    Computability and Computable Uniqueness of Urysohn's Universal Metric Space. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:149-159 [Conf]
  13. Tien D. Kieu
    Mathematical Computability Questions for some Classes of Linear and Non-Linear Differential Equations Originated from Hilbert's Tenth Problem. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:161-168 [Conf]
  14. Branimir Lambov
    RealLib: an Efficient Implementation of Exact Real Arithmetic. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:169-175 [Conf]
  15. Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi
    Fine Computable Functions and Effective Fine Convergence. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:177-197 [Conf]
  16. Robert Rettinger, Xizhong Zheng
    A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:199-209 [Conf]
  17. Matthias Schröder, Alex K. Simpson
    Representing Probability Measures using Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:211-226 [Conf]
  18. Paul Taylor 0002
    A Lambda Calculus for Real Analysis. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:227-266 [Conf]
  19. Klaus Weihrauch
    Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:267-300 [Conf]
  20. Mariko Yasugi, Takakazu Mori, Yoshiki Tsujii
    Effective Sequence of Uniformities and its Effective Limit. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:301-318 [Conf]
  21. Satoru Yoshida
    Generalized Functions with Pseudobounded Support in Constructive Mathematics. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:319-340 [Conf]
  22. Fuxiang Yu, Arthur W. Chou, Ker-I Ko
    On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:341-355 [Conf]
  23. Martin Ziegler
    Effectively Open Real Functions. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:357-374 [Conf]
  24. Takashi Kohno
    Design of Neuromorphic Hardwares. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:377-378 [Conf]
  25. Peter Hertling
    Computable Analysis via Representations. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:377- [Conf]
  26. Norbert Th. Müller
    Implementing Exact Real Numbers Efficiently. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:378- [Conf]
  27. Andrej Bauer
    Realizability as Connection between Constructive and Computable Mathematics. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:378-379 [Conf]
  28. Atsushi Yoshikawa, Mariko Yasugi
    Computable Versions of Basic Theorems in Functional Analysis. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:378- [Conf]
  29. Martín Hötzel Escardó
    Compactness in Topology and Computation. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:379- [Conf]
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