This is the homepage of Florian Steinberg
My PhD project was supervised by Prof. Dr. Martin Ziegler, Prof. Akitoshi Kawamura and Prof. Dr. Ulrich Kohlenbach and funded by the IRTG 1529.
Research interests:
 Formal proofs and program extraction in particular for computation on infinite data
 Computability and complexity theory for partial differential equations
 Weihrauch reducibility and polynomialtime Weihrauch reductions
 Computable analysis based software: iRRAM , AERN, Ariadne etc.
Software:
 incone: Information theoretic continuity.
Events of interest:
The annual conferences CCA, CCC and LICS.
Publications:

F. Steinberg, Laurent Thery, Holger Thies:
Quantitative continuity and computable analysis in Coq,
Interactive Theorem Proving, ITP 2019. Proceedings in LIPICS vol. 141.
 Eike Neumann, Florian Steinberg:
Parametrised secondorder complexity theory with applications to the study of interval computation,
Theoretical Computer Science 806 (2020): 281304.
arXiv version available at arXiv:1711.10530 .
 Bruce M. Kapron, F. Steinberg:
Typetwo Iteration with Bounded Query Revision,
Developments in Implicit Computational complExity,
DICEFOPARA 2019.
 Akitoshi Kawamura, F. Steinberg, Holger Thies:
Secondorder lineartime computability with applications to computable analysis,
Theory and Applications of Models of Computation,
TAMC 2019.
 Akitoshi Kawamura, F. Steinberg, Holger Thies:
Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving,
International Workshop on Logic, Language, Information, and Computation,
WoLLIC 2018.
Proceedings in LNCS vol. 10944.

Bruce M. Kapron, F. Steinberg:
Typetwo polynomialtime and restricted lookahead,
Logic in Computer Science, LICS '18.
Proceedings of the 33rd Anual ACM/IEEE Symposiun on Logic in Computer Science.

Akitoshi Kawamura, F. Steinberg:
Polynomial running times for polynomialtime oracle machines,
Formal Structures for Computation and Deduction, FSCD 2017.
Proceedings in LIPICS Vol. 84.

Matthias Schröder, F. Steinberg:
Bounded time computation on metric spaces and Banach spaces,
Logic in Computer Science, LICS'17.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science.

F. Steinberg:
Complexity theory for spaces of integrable functions,
Logical Methods in Computer Science, vol. 13(3:21)2017, pp. 139

Arno Pauly,
F. Steinberg:
Comparing Representations for Function Spaces in Analysis,
Theory of Computing Systems, 126, January 2017; open access version available here.

Akitoshi Kawamura,
F. Steinberg,
Martin Ziegler:
Complexity Theory of (Functions on) Compact Metric Spaces,
Logic in Computer Science, LICS'16. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science.

Akitoshi Kawamura,
F. Steinberg,
Martin Ziegler:
Towards Comptational Complexity Theory on Advanced Function Spaces in Analysis,
Computability in Europe, CiE 2016.
Proceedings in LNCS vol. 9709.

Arno Pauly,
F. Steinberg:
Representations of analytic functions and Weihrauch degrees,
International Computer Science Symposium in Russia, CSR 2016.
Proceedings in LNCS vol. 9691. arXiv version here

Akitoshi Kawamura,
F. Steinberg,
Martin Ziegler:
On the Computational Complexity of the Dirichlet Problem for Poisson's Equation,
Mathematical Structures in Computer Science, 1:129, July 2016.

Matthias Schröder,
F. Steinberg,
Martin Ziegler:
AverageCase BitComplexity Theory of Real Functions,
Mathematical aspects of computer and information sciences, MACIS 2015.
Proceedings in LNCS vol. 9582.
Preprints:
Invited talks:
 September 2019: on the CCC workshop.
 September 2018: in the PhD colloquium of the Colloqium Logicum 2018.
 September 2018: on the CCA 2018 conference.
 March 2017: in the research seminar of the working group "Geometrie und Approximation".
 February 2017: in the series "Gedanken zur information"
Contact:
Phone: No.
Email: moc.liamg@grebnietsf
You can find me on GitHub, Bitbucket and ResearchGate.