Abstract is missing.
- Computer Verified Exact Analysis (Tutorial)Bas Spitters, Russell O Connor. [doi]
- Computing Conformal Maps onto Canonical Slit DomainsValentin V. Andreev, Timothy H. McNicholl. [doi]
- Effective Dispersion in Computable Metric SpacesZvonko Iljazovic. [doi]
- Uniqueness, Continuity, and Existence of Implicit Functions in Constructive AnalysisHannes Diener, Peter Schuster. [doi]
- Computable Analysis of Differential Equations (Invited Talk)Ning Zhong. [doi]
- A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract)Matthias Schröder. [doi]
- On the Computability of Rectifiable Simple Curve (Extended Abstract)Robert Rettinger, Xizhong Zheng. [doi]
- A Constructive Study of Landau s Summability TheoremJosef Berger, Douglas S. Bridges. [doi]
- From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interval and p-Box Uncertainty (Invited Talk)Vladik Kreinovich. [doi]
- Realisability and Adequacy for (Co)inductionUlrich Berger. [doi]
- Weihrauch Degrees, Omniscience Principles and Weak ComputabilityVasco Brattka, Guido Gherardi. [doi]
- Relativizations of the P =? DNP Question for the BSS ModelChristine Gaßner. [doi]
- Theory and Practice of Higher-type Computation (Tutorial)MartÃn Hötzel Escardó. [doi]
- Semilattices, Domains, and Computability (Invited Talk)Dana S. Scott. [doi]
- Curves That Must Be RetracedXiaoyang Gu, Jack H. Lutz, Elvira Mayordomo. [doi]
- Towards the Complexity of Riemann Mappings (Extended Abstract)Robert Rettinger. [doi]
- Canonical Effective Subalgebras of Classical Algebras as Constructive Metric CompletionsAndrej Bauer, Jens Blanck. [doi]
- Computability and Complexity of Julia Sets (Invited Talk)Mark Braverman. [doi]
- Effective Choice and Boundedness Principles in Computable AnalysisVasco Brattka, Guido Gherardi. [doi]
- Sigma^0_alpha - Admissible Representations (Extended Abstract)Matthew de Brecht, Akihiro Yamamoto. [doi]
- Computability of Probability Distributions and Distribution FunctionsTakakazu Mori, Yoshiki Tsujii, Mariko Yasugi. [doi]
- CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in AnalysisAndrej Bauer, Peter Hertling, Ker-I Ko. [doi]
- How Discontinuous is Computing Nash Equilibria? (Extended Abstract)Arno Pauly. [doi]
- CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in AnalysisAndrej Bauer, Peter Hertling, Ker-I Ko. [doi]
- Separations of Non-monotonic Randomness NotionsLaurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle. [doi]
- Random Iteration Algorithm for Graph-Directed SetsYoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hideki Tsuiki. [doi]
- On Oscillation-free epsilon-random Sequences IIJöran Mielke, Ludwig Staiger. [doi]
- Computability of Homology for Compact Absolute Neighbourhood RetractsPieter Collins. [doi]
- Computable Separation in Topology, from T_0 to T_3Klaus Weihrauch. [doi]