CCA C

31 papers

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