Average-Case Bit-Complexity Theory of Real Functions. - Matthias Schröder 001; Florian Steinberg 001; Martin Ziegler 001 (MACIS, 2015)

Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (CiE, 2016)

Representations of Analytic Functions and Weihrauch Degrees. - Arno Pauly; Florian Steinberg 001 (CSR, 2016)

Complexity Theory of (Functions on) Compact Metric Spaces. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (LICS, 2016)

Bounded time computation on metric spaces and Banach spaces. - Matthias Schröder 001; Florian Steinberg 001 (LICS, 2017)

Polynomial Running Times for Polynomial-Time Oracle Machines. - Akitoshi Kawamura; Florian Steinberg 001 (FSCD, 2017)

A minimal representation for continuous functions. - Franz Brauße; Florian Steinberg 001 (CoRR, 2017)

Complexity theory for spaces of integrable functions. - Florian Steinberg 001 (Log. Methods Comput. Sci., 2017)

On the computational complexity of the Dirichlet Problem for Poisson's Equation. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (Math. Struct. Comput. Sci., 2017)

Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. - Akitoshi Kawamura; Florian Steinberg 001; Holger Thies (WoLLIC, 2018)

Comparing Representations for Function Spaces in Computable Analysis. - Arno Pauly; Florian Steinberg 001 (Theory Comput. Syst., 2018)

Quantitative Continuity and Computable Analysis in Coq. - Florian Steinberg 001; Laurent Théry; Holger Thies (ITP, 2019)

Second-Order Linear-Time Computability with Applications to Computable Analysis. - Akitoshi Kawamura; Florian Steinberg 001; Holger Thies (TAMC, 2019)

Type-two Iteration with Bounded Query Revision. - Bruce M. Kapron; Florian Steinberg 001 (DICE-FOPARA@ETAPS, 2019)

Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). - Bruce M. Kapron; Akitoshi Kawamura; Florian Steinberg 001 (NII Shonan Meet. Rep., 2019)

Computable Analysis for Verified Exact Real Computation. - Michal Konecný; Florian Steinberg 001; Holger Thies (FSTTCS, 2020)

Continuous and Monotone Machines. - Michal Konecný; Florian Steinberg 001; Holger Thies (MFCS, 2020)

Type-two polynomial-time and restricted lookahead. - Bruce M. Kapron; Florian Steinberg 001 (Theor. Comput. Sci., 2020)

Parametrised second-order complexity theory with applications to the study of interval computation. - Eike Neumann; Florian Steinberg 001 (Theor. Comput. Sci., 2020)

Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations. - Svetlana Selivanova; Florian Steinberg 001; Holger Thies; Martin Ziegler 001 (CASC, 2021)

Computing Measure as a Primitive Operation in Real Number Computation. - Christine Gaßner; Arno Pauly; Florian Steinberg 001 (CSL, 2021)

Computable analysis and notions of continuity in Coq. - Florian Steinberg 001; Laurent Théry; Holger Thies (Log. Methods Comput. Sci., 2021)