Conferences in DBLP

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

1. 
   Computable Separation in Topology, from T_0 to T_3. [Citation Graph (, )][DBLP]
   
   
2. 
   Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions. [Citation Graph (, )][DBLP]
   
   
3. 
   Effective Choice and Boundedness Principles in Computable Analysis. [Citation Graph (, )][DBLP]
   
   
4. 
   Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis. [Citation Graph (, )][DBLP]
   
   
5. 
   Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability. [Citation Graph (, )][DBLP]
   
   
6. 
   On the Computability of Rectifiable Simple Curve (Extended Abstract). [Citation Graph (, )][DBLP]
   
   
7. 
   A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract). [Citation Graph (, )][DBLP]
   
   
8. 
   Computability and Complexity of Julia Sets (Invited Talk). [Citation Graph (, )][DBLP]
   
   
9. 
   Computable Analysis of Differential Equations (Invited Talk). [Citation Graph (, )][DBLP]
   
   
10. 
    Computing Conformal Maps onto Canonical Slit Domains. [Citation Graph (, )][DBLP]
    
    
11. 
    Separations of Non-monotonic Randomness Notions. [Citation Graph (, )][DBLP]
    
    
12. 
    A Constructive Study of Landau's Summability Theorem. [Citation Graph (, )][DBLP]
    
    
13. 
    From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interval and p-Box Uncertainty (Invited Talk). [Citation Graph (, )][DBLP]
    
    
14. 
    CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. [Citation Graph (, )][DBLP]
    
    
15. 
    Sigma^0_alpha - Admissible Representations (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
16. 
    Realisability and Adequacy for (Co)induction. [Citation Graph (, )][DBLP]
    
    
17. 
    Computer Verified Exact Analysis (Tutorial). [Citation Graph (, )][DBLP]
    
    
18. 
    On Oscillation-free epsilon-random Sequences II. [Citation Graph (, )][DBLP]
    
    
19. 
    CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. [Citation Graph (, )][DBLP]
    
    
20. 
    Semilattices, Domains, and Computability (Invited Talk). [Citation Graph (, )][DBLP]
    
    
21. 
    Computability of Probability Distributions and Distribution Functions. [Citation Graph (, )][DBLP]
    
    
22. 
    How Discontinuous is Computing Nash Equilibria? (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
23. 
    Effective Dispersion in Computable Metric Spaces. [Citation Graph (, )][DBLP]
    
    
24. 
    Relativizations of the P =? DNP Question for the BSS Model. [Citation Graph (, )][DBLP]
    
    
25. 
    Weihrauch Degrees, Omniscience Principles and Weak Computability. [Citation Graph (, )][DBLP]
    
    
26. 
    Towards the Complexity of Riemann Mappings (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
27. 
    Curves That Must Be Retraced. [Citation Graph (, )][DBLP]
    
    
28. 
    Random Iteration Algorithm for Graph-Directed Sets. [Citation Graph (, )][DBLP]
    
    
29. 
    Theory and Practice of Higher-type Computation (Tutorial). [Citation Graph (, )][DBLP]
    
    
30. 
    Computability of Homology for Compact Absolute Neighbourhood Retracts. [Citation Graph (, )][DBLP]