Florian Steinberg

According to our database, Florian Steinberg authored at least 22 papers between 2015 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Computable analysis and notions of continuity in Coq.

Florian Steinberg, Laurent Théry, Holger Thies

Log. Methods Comput. Sci., 2021

Computing Measure as a Primitive Operation in Real Number Computation.

Christine Gaßner, Arno Pauly, Florian Steinberg

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations.

Svetlana Selivanova, Florian Steinberg, Holger Thies, Martin Ziegler

Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020

Parametrised second-order complexity theory with applications to the study of interval computation.

Eike Neumann, Florian Steinberg

Theor. Comput. Sci., 2020

Type-two polynomial-time and restricted lookahead.

Bruce M. Kapron, Florian Steinberg

Theor. Comput. Sci., 2020

Continuous and Monotone Machines.

Michal Konecný, Florian Steinberg, Holger Thies

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Computable Analysis for Verified Exact Real Computation.

Michal Konecný, Florian Steinberg, Holger Thies

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151).

Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg

NII Shonan Meet. Rep., 2019

Type-two Iteration with Bounded Query Revision.

Bruce M. Kapron, Florian Steinberg

Proceedings of the Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis, 2019

Second-Order Linear-Time Computability with Applications to Computable Analysis.

Akitoshi Kawamura, Florian Steinberg, Holger Thies

Proceedings of the Theory and Applications of Models of Computation, 2019

Quantitative Continuity and Computable Analysis in Coq.

Florian Steinberg, Laurent Théry, Holger Thies

Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018

Comparing Representations for Function Spaces in Computable Analysis.

Arno Pauly, Florian Steinberg

Theory Comput. Syst., 2018

Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving.

Akitoshi Kawamura, Florian Steinberg, Holger Thies

Proceedings of the Logic, Language, Information, and Computation, 2018

2017

On the computational complexity of the Dirichlet Problem for Poisson's Equation.

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Math. Struct. Comput. Sci., 2017

Complexity theory for spaces of integrable functions.

Florian Steinberg

Log. Methods Comput. Sci., 2017

A minimal representation for continuous functions.

Franz Brauße, Florian Steinberg

CoRR, 2017

Polynomial Running Times for Polynomial-Time Oracle Machines.

Akitoshi Kawamura, Florian Steinberg

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Bounded time computation on metric spaces and Banach spaces.

Matthias Schröder, Florian Steinberg

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Complexity Theory of (Functions on) Compact Metric Spaces.

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Representations of Analytic Functions and Weihrauch Degrees.

Arno Pauly, Florian Steinberg

Proceedings of the Computer Science - Theory and Applications, 2016

Towards Computational Complexity Theory on Advanced Function Spaces in Analysis.

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

Average-Case Bit-Complexity Theory of Real Functions.

Matthias Schröder, Florian Steinberg, Martin Ziegler

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015