| 2009 | Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability. | Martin Ziegler |
| 2009 | Computable Analysis of Differential Equations (Invited Talk). | Ning Zhong |
| 2009 | Computable Separation in Topology, from T_0 to T_3. | Klaus Weihrauch |
| 2009 | Random Iteration Algorithm for Graph-Directed Sets. | Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hideki Tsuiki |
| 2009 | Computer Verified Exact Analysis (Tutorial). | Bas Spitters, Russell O'Connor |
| 2009 | Semilattices, Domains, and Computability (Invited Talk). | Dana S. Scott |
| 2009 | A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract). | Matthias Schrder |
| 2009 | On the Computability of Rectifiable Simple Curve (Extended Abstract). | Robert Rettinger, Xizhong Zheng |
| 2009 | Towards the Complexity of Riemann Mappings (Extended Abstract). | Robert Rettinger |
| 2009 | How Discontinuous is Computing Nash Equilibria? (Extended Abstract). | Arno Pauly |
| 2009 | Computability of Probability Distributions and Distribution Functions. | Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi |
| 2009 | On Oscillation-free epsilon-random Sequences II. | Jran Mielke, Ludwig Staiger |
| 2009 | 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 |
| 2009 | Effective Dispersion in Computable Metric Spaces. | Zvonko Iljazovic |
| 2009 | Curves That Must Be Retraced. | Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo |
| 2009 | Relativizations of the P =? DNP Question for the BSS Model. | Christine Ganer |
| 2009 | Theory and Practice of Higher-type Computation (Tutorial). | Martn Htzel Escard |
| 2009 | Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis. | Hannes Diener, Peter Schuster |
| 2009 | Computability of Homology for Compact Absolute Neighbourhood Retracts. | Pieter Collins |
| 2009 | Sigma^0_alpha - Admissible Representations (Extended Abstract). | Matthew de Brecht, Akihiro Yamamoto |
| 2009 | Computability and Complexity of Julia Sets (Invited Talk). | Mark Braverman |
| 2009 | Effective Choice and Boundedness Principles in Computable Analysis. | Vasco Brattka, Guido Gherardi |
| 2009 | Weihrauch Degrees, Omniscience Principles and Weak Computability. | Vasco Brattka, Guido Gherardi |
| 2009 | Separations of Non-monotonic Randomness Notions. | Laurent Bienvenu, Rupert Hlzl, Thorsten Krling, Wolfgang Merkle |
| 2009 | A Constructive Study of Landau's Summability Theorem. | Josef Berger, Douglas S. Bridges |