- Andrej Bauer, Peter Hertling, Ker-I Ko:
Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, August 18-22, 2009, Ljubljana, Slovenia. OASIcs 11, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009 [contents] - 2008
- Valentin V. Andreev, Dale Daniel, Timothy H. McNicholl:
Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains. CCA 2008: 127-139 - Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker:
Stability for Effective Algebras. CCA 2008: 3-15 - Volker Bosserhoff:
On the Effective Existence of Schauder Bases: (Extended Abstract). CCA 2008: 17-21 - Vasco Brattka, Ruth Dillhage, Tanja Grubba, Angela Klutsch:
Preface. CCA 2008: 1 - Manuel Lameiras Campagnolo, Kerry Ojakian:
Characterizing Computable Analysis with Differential Equations. CCA 2008: 23-35 - Pieter Collins:
Computability and Representations of the Zero Set. CCA 2008: 37-43 - Pieter Collins, Daniel Silva Graça:
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach. CCA 2008: 103-114 - Ruth Dillhage, Vasco Brattka:
Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces. CCA 2008: 45-60 - Willem L. Fouché:
An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity. CCA 2008: 61-69 - Christine Gaßner:
On Relativizations of the P =? NP Question for Several Structures. CCA 2008: 71-83 - Guido Gherardi, Alberto Marcone:
How Incomputable is the Separable Hahn-Banach Theorem? CCA 2008: 85-102 - Margarita V. Korovina, Oleg V. Kudinov:
Towards Computability over Effectively Enumerable Topological Spaces. CCA 2008: 115-125 - Davorin Lesnik:
Constructive Urysohn's Universal Metric Space. CCA 2008: 171-179 - Jöran Mielke:
Refined Bounds on Kolmogorov Complexity for omega-Languages. CCA 2008: 181-189 - Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii:
Integral of Two-dimensional Fine-computable Functions. CCA 2008: 141-152 - Norbert Th. Müller, Xishun Zhao:
Jordan Areas and Grids. CCA 2008: 191-206 - Robert Rettinger:
Lower Bounds on the Continuation of Holomorphic Functions. CCA 2008: 207-217 - Robert Rettinger, Klaus Weihrauch, Ning Zhong:
Complexity of Blowup Problems: Extended Abstract. CCA 2008: 219-230 - Matthias Schröder:
An Effective Tietze-Urysohn Theorem for QCB-Spaces: (Extended Abstract). CCA 2008: 231-242 - Victor L. Selivanov:
On the Difference Hierarchy in Countably Based T0-Spaces. CCA 2008: 257-269 - Svetlana Selivanova, Victor L. Selivanov:
Computing Solutions of Symmetric Hyperbolic Systems of PDE's. CCA 2008: 243-255 - Dieter Spreen:
On the Continuity of Effective Multifunctions. CCA 2008: 271-286 - Ludwig Staiger:
On Oscillation-free epsilon-random Sequences. CCA 2008: 287-297 - Hideki Tsuiki, Shuji Yamada:
On Finite-time Computability Preserving Conversions. CCA 2008: 299-308 - Martin Ziegler, Wouter M. Koolen:
Kolmogorov Complexity Theory over the Reals. CCA 2008: 153-169 - Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, CCA 2007, Siena, Italy, June 16-18, 2007. Electronic Notes in Theoretical Computer Science 202, Elsevier 2008 [contents] - Vasco Brattka, Ruth Dillhage, Tanja Grubba, Angela Klutsch:
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, CCA 2008, Hagen, Germany, August 21-24, 2008. Electronic Notes in Theoretical Computer Science 221, Elsevier 2008 [contents] - 2007
- Marian Alexandru Baroni, Douglas S. Bridges:
Continuity Properties of Preference Relations. CCA 2007: 19-25 - Prashant Batra:
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra. CCA 2007: 201-218