OASIcs, Volume 11, CCA 2009

• Andrej Bauer, Peter Hertling, and Ker-I Ko OASIcs, Volume 11, CCA'09, Complete Volume 10.4230/OASIcs.CCA.2009
• Andrej Bauer, Peter Hertling, and Ker-I Ko CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis 10.4230/OASIcs.CCA.2009.2248
• Andrej Bauer, Peter Hertling, and Ker-I Ko CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis 10.4230/OASIcs.CCA.2009.2249
• Mark Braverman Computability and Complexity of Julia Sets (Invited Talk) 10.4230/OASIcs.CCA.2009.2250
• Vladik Kreinovich From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interval and p-Box Uncertainty (Invited Talk) 10.4230/OASIcs.CCA.2009.2251
• Dana Scott Semilattices, Domains, and Computability (Invited Talk) 10.4230/OASIcs.CCA.2009.2252
• Ning Zhong Computable Analysis of Differential Equations (Invited Talk) 10.4230/OASIcs.CCA.2009.2253
• Martin Escardó Theory and Practice of Higher-type Computation (Tutorial) 10.4230/OASIcs.CCA.2009.2254
• Bas Spitters and Russell O'Connor Computer Verified Exact Analysis (Tutorial) 10.4230/OASIcs.CCA.2009.2255
• Valentin V. Andreev and Timothy H. McNicholl Computing Conformal Maps onto Canonical Slit Domains 10.4230/OASIcs.CCA.2009.2256
• Andrej Bauer and Jens Blanck Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions 10.4230/OASIcs.CCA.2009.2257
• Ulrich Berger Realisability and Adequacy for (Co)induction 10.4230/OASIcs.CCA.2009.2258
• Josef Berger and Douglas Bridges A Constructive Study of Landau's Summability Theorem 10.4230/OASIcs.CCA.2009.2259
• Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, and Wolfgang Merkle Separations of Non-monotonic Randomness Notions 10.4230/OASIcs.CCA.2009.2260
• Vasco Brattka and Guido Gherardi Weihrauch Degrees, Omniscience Principles and Weak Computability 10.4230/OASIcs.CCA.2009.2261
• Vasco Brattka and Guido Gherardi Effective Choice and Boundedness Principles in Computable Analysis 10.4230/OASIcs.CCA.2009.2262
• Pieter Collins Computability of Homology for Compact Absolute Neighbourhood Retracts 10.4230/OASIcs.CCA.2009.2263
• Matthew de Brecht and Akihiro Yamamoto Sigma^0_alpha - Admissible Representations (Extended Abstract) 10.4230/OASIcs.CCA.2009.2264
• Hannes Diener and Peter Schuster Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis 10.4230/OASIcs.CCA.2009.2265
• Christine Gaßner Relativizations of the P =? DNP Question for the BSS Model 10.4230/OASIcs.CCA.2009.2266
• Xiaoyang Gu, Jack H. Lutz, and Elvira Mayordomo Curves That Must Be Retraced 10.4230/OASIcs.CCA.2009.2267
• Zvonko Iljazovic Effective Dispersion in Computable Metric Spaces 10.4230/OASIcs.CCA.2009.2268
• Jöran Mielke and Ludwig Staiger On Oscillation-free epsilon-random Sequences II 10.4230/OASIcs.CCA.2009.2269
• Takakazu Mori, Yoshiki Tsujii, and Mariko Yasugi Computability of Probability Distributions and Distribution Functions 10.4230/OASIcs.CCA.2009.2270
• Arno Pauly How Discontinuous is Computing Nash Equilibria? (Extended Abstract) 10.4230/OASIcs.CCA.2009.2271
• Robert Rettinger Towards the Complexity of Riemann Mappings (Extended Abstract) 10.4230/OASIcs.CCA.2009.2272
• Robert Rettinger and Xizhong Zheng On the Computability of Rectifiable Simple Curve (Extended Abstract) 10.4230/OASIcs.CCA.2009.2273
• Matthias Schröder A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract) 10.4230/OASIcs.CCA.2009.2274
• Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, and Hideki Tsuiki Random Iteration Algorithm for Graph-Directed Sets 10.4230/OASIcs.CCA.2009.2275
• Klaus Weihrauch Computable Separation in Topology, from T_0 to T_3 10.4230/OASIcs.CCA.2009.2276
• Martin Ziegler Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability 10.4230/OASIcs.CCA.2009.2277