Florian Steinberg

Publication Activity (10 Years)

Years Active: 2015-2021
Publications (10 Years): 31

Top Topics

Polynomial Hierarchy

Complexity Theory

Multidimensional Index

Top Venues

Theor. Comput. Sci.

Log. Methods Comput. Sci.

Publications

Christine Gaßner, Arno Pauly, Florian Steinberg
Computing Measure as a Primitive Operation in Real Number Computation. CSL (2021)
Florian Steinberg, Laurent Théry, Holger Thies
Computable analysis and notions of continuity in Coq. Log. Methods Comput. Sci. 17 (2) (2021)
Svetlana Selivanova, Florian Steinberg, Holger Thies, Martin Ziegler
Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations. CASC (2021)
Eike Neumann, Florian Steinberg
Parametrised second-order complexity theory with applications to the study of interval computation. Theor. Comput. Sci. 806 (2020)
Michal Konecný, Florian Steinberg, Holger Thies
Continuous and Monotone Machines. MFCS (2020)
Michal Konecný, Florian Steinberg, Holger Thies
Computable Analysis for Verified Exact Real Computation. FSTTCS (2020)
Michal Konecný, Florian Steinberg, Holger Thies
Continuous and monotone machines. CoRR (2020)
Bruce M. Kapron, Florian Steinberg
Type-two polynomial-time and restricted lookahead. Theor. Comput. Sci. 813 (2020)
Florian Steinberg, Laurent Théry, Holger Thies
Quantitative Continuity and Computable Analysis in Coq. ITP (2019)
Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg
Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). NII Shonan Meet. Rep. 2019 (2019)
Akitoshi Kawamura, Florian Steinberg, Holger Thies
Second-Order Linear-Time Computability with Applications to Computable Analysis. TAMC (2019)
Florian Steinberg, Laurent Théry, Holger Thies
Quantitative continuity and computable analysis in Coq. CoRR (2019)
Bruce M. Kapron, Florian Steinberg
Type-two Iteration with Bounded Query Revision. DICE-FOPARA@ETAPS (2019)
Bruce M. Kapron, Florian Steinberg
Type-two polynomial-time and restricted lookahead. CoRR (2018)
Bruce M. Kapron, Florian Steinberg
Type-two polynomial-time and restricted lookahead. LICS (2018)
Akitoshi Kawamura, Florian Steinberg, Holger Thies
Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. WoLLIC (2018)
Arno Pauly, Florian Steinberg
Comparing Representations for Function Spaces in Computable Analysis. Theory Comput. Syst. 62 (3) (2018)
Akitoshi Kawamura, Florian Steinberg, Martin Ziegler
On the computational complexity of the Dirichlet Problem for Poisson's Equation. Math. Struct. Comput. Sci. 27 (8) (2017)
Franz Brauße, Florian Steinberg
A minimal representation for continuous functions. CoRR (2017)
Akitoshi Kawamura, Florian Steinberg
Polynomial running times for polynomial-time oracle machines. CoRR (2017)
Matthias Schröder, Florian Steinberg
Bounded time computation on metric spaces and Banach spaces. LICS (2017)
Eike Neumann, Florian Steinberg
Parametrised second-order complexity theory with applications to the study of interval computation. CoRR (2017)
Matthias Schröder, Florian Steinberg
Bounded time computation on metric spaces and Banach spaces. CoRR (2017)
Akitoshi Kawamura, Florian Steinberg
Polynomial Running Times for Polynomial-Time Oracle Machines. FSCD (2017)
Florian Steinberg
Complexity theory for spaces of integrable functions. Log. Methods Comput. Sci. 13 (3) (2017)
Akitoshi Kawamura, Florian Steinberg, Martin Ziegler
Complexity Theory of (Functions on) Compact Metric Spaces. LICS (2016)
Arno Pauly, Florian Steinberg
Representations of Analytic Functions and Weihrauch Degrees. CSR (2016)
Florian Steinberg
Complexity theory for spaces of integrable functions. CoRR (2016)
Akitoshi Kawamura, Florian Steinberg, Martin Ziegler
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. CiE (2016)
Arno Pauly, Florian Steinberg
Representations of analytic functions and Weihrauch degrees. CoRR (2015)
Matthias Schröder, Florian Steinberg, Martin Ziegler
Average-Case Bit-Complexity Theory of Real Functions. MACIS (2015)