OASIcs, Volume 11
CCA 2009, August 18-22, 2009, Ljubljana, Slovenia
Editors: Andrej Bauer, Peter Hertling, and Ker-I Ko
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Manon Blanc and Olivier Bournez. The Complexity of Computing in Continuous Time: Space Complexity Is Precision. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 129:1-129:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{blanc_et_al:LIPIcs.ICALP.2024.129, author = {Blanc, Manon and Bournez, Olivier}, title = {{The Complexity of Computing in Continuous Time: Space Complexity Is Precision}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {129:1--129:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.129}, URN = {urn:nbn:de:0030-drops-202722}, doi = {10.4230/LIPIcs.ICALP.2024.129}, annote = {Keywords: Models of computation, Ordinary differential equations, Real computations, Analog computations, Complexity theory, Implicit complexity, Recursion scheme} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@Proceedings{bauer_et_al:OASIcs.CCA.2009, title = {{OASIcs, Volume 11, CCA'09, Complete Volume}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2012}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009}, URN = {urn:nbn:de:0030-drops-35738}, doi = {10.4230/OASIcs.CCA.2009}, annote = {Keywords: Mathematics of Computing, Analysis of Algorithms and Problem Complexity} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bauer_et_al:OASIcs.CCA.2009.2248, author = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, title = {{CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {i--ii}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2248}, URN = {urn:nbn:de:0030-drops-22486}, doi = {10.4230/OASIcs.CCA.2009.2248}, annote = {Keywords: Computable analysis, computability, complexity, Turing machine, constructive mathematics, real number computation, computer arithmetic, exact real ari} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Andrej Bauer, Peter Hertling, and Ker-I Ko. CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bauer_et_al:OASIcs.CCA.2009.2249, author = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, title = {{CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {1--1}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2249}, URN = {urn:nbn:de:0030-drops-22492}, doi = {10.4230/OASIcs.CCA.2009.2249}, annote = {Keywords: Computable analysis, computability, complexity, Turing machine, constructive mathematics, real number computation, computer arithmetic, exact real ari} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Mark Braverman. Computability and Complexity of Julia Sets (Invited Talk). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{braverman:OASIcs.CCA.2009.2250, author = {Braverman, Mark}, title = {{Computability and Complexity of Julia Sets}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {3--3}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2250}, URN = {urn:nbn:de:0030-drops-22508}, doi = {10.4230/OASIcs.CCA.2009.2250}, annote = {Keywords: Computability, computable analysis, dynamical systems, complex dynamics, Julia sets Computability, computable analysis, dynamical systems, complex dynamics, Julia sets} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
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). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 5-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{kreinovich:OASIcs.CCA.2009.2251, author = {Kreinovich, Vladik}, title = {{From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interval and p-Box Uncertainty}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {5--16}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2251}, URN = {urn:nbn:de:0030-drops-22516}, doi = {10.4230/OASIcs.CCA.2009.2251}, annote = {Keywords: Interval computations, set computations, probability boxes, uncertainty, efficient algorithms} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Dana Scott. Semilattices, Domains, and Computability (Invited Talk). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{scott:OASIcs.CCA.2009.2252, author = {Scott, Dana}, title = {{Semilattices, Domains, and Computability}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {17--17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2252}, URN = {urn:nbn:de:0030-drops-22525}, doi = {10.4230/OASIcs.CCA.2009.2252}, annote = {Keywords: Semilattices, domains, computability} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Ning Zhong. Computable Analysis of Differential Equations (Invited Talk). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{zhong:OASIcs.CCA.2009.2253, author = {Zhong, Ning}, title = {{Computable Analysis of Differential Equations}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {19--19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2253}, URN = {urn:nbn:de:0030-drops-22535}, doi = {10.4230/OASIcs.CCA.2009.2253}, annote = {Keywords: Computable analysis, differential equations} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Martin Escardó. Theory and Practice of Higher-type Computation (Tutorial). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{escardo:OASIcs.CCA.2009.2254, author = {Escard\'{o}, Martin}, title = {{Theory and Practice of Higher-type Computation}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {21--21}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2254}, URN = {urn:nbn:de:0030-drops-22540}, doi = {10.4230/OASIcs.CCA.2009.2254}, annote = {Keywords: Higher-type computation, domain theory, Kleene-Kreisel spaces, Ershov-Scott domains, QCB spaces, equilogical spaces, PCF} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Bas Spitters and Russell O'Connor. Computer Verified Exact Analysis (Tutorial). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{spitters_et_al:OASIcs.CCA.2009.2255, author = {Spitters, Bas and O'Connor, Russell}, title = {{Computer Verified Exact Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {23--23}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2255}, URN = {urn:nbn:de:0030-drops-22554}, doi = {10.4230/OASIcs.CCA.2009.2255}, annote = {Keywords: Proof assistant, dependent type theory, constructive analysis} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Valentin V. Andreev and Timothy H. McNicholl. Computing Conformal Maps onto Canonical Slit Domains. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 25-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{andreev_et_al:OASIcs.CCA.2009.2256, author = {Andreev, Valentin V. and McNicholl, Timothy H.}, title = {{Computing Conformal Maps onto Canonical Slit Domains}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {25--36}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2256}, URN = {urn:nbn:de:0030-drops-22561}, doi = {10.4230/OASIcs.CCA.2009.2256}, annote = {Keywords: Computable analysis, conformal mapping} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Andrej Bauer and Jens Blanck. Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 37-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bauer_et_al:OASIcs.CCA.2009.2257, author = {Bauer, Andrej and Blanck, Jens}, title = {{Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {37--48}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2257}, URN = {urn:nbn:de:0030-drops-22579}, doi = {10.4230/OASIcs.CCA.2009.2257}, annote = {Keywords: Effective algebras, realizability, constructive metric spaces} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Ulrich Berger. Realisability and Adequacy for (Co)induction. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 49-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{berger:OASIcs.CCA.2009.2258, author = {Berger, Ulrich}, title = {{Realisability and Adequacy for (Co)induction}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {49--60}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2258}, URN = {urn:nbn:de:0030-drops-22581}, doi = {10.4230/OASIcs.CCA.2009.2258}, annote = {Keywords: Constructive Analysis, realisability, program extraction, semantics} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Josef Berger and Douglas Bridges. A Constructive Study of Landau's Summability Theorem. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 61-70, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{berger_et_al:OASIcs.CCA.2009.2259, author = {Berger, Josef and Bridges, Douglas}, title = {{A Constructive Study of Landau's Summability Theorem}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {61--70}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2259}, URN = {urn:nbn:de:0030-drops-22595}, doi = {10.4230/OASIcs.CCA.2009.2259}, annote = {Keywords: Constructive analysis, Landau's theorem, uniform boundedness theorem Constructive analysis, Landau's theorem, uniform boundedness theorem} }