This is the homepage of Florian Steinberg

Research interests:

• Formal proofs, in particular about computation on infinite data
• Computability and complexity theory for partial differential equations
• Weihrauch degrees and polynomial-time Weihrauch reductions
• Software based on computable analysis such as iRRAM , AERN, Ariadne, incone etc.

Journal publications:

• F. Steinberg, Laurent Thery, Holger Thies:
  Computable analysis and notions of continuity in Coq,
  accepted for publication in LMCS.
• Bruce M. Kapron, F. Steinberg:
  Type-two polynomial-time and restricted lookahead,
  Theoretical Computer Science, volume 813 (2020), pages 1 - 19. open access version available at arXiv:1801.07485.
• Eike Neumann, F. Steinberg:
  Parametrised second-order complexity theory with applications to the study of interval computation,
  Theoretical Computer Science, volume 806 (2020), pages 281-304. open access version available at arXiv:1711.10530.
• F. Steinberg:
  Complexity theory for spaces of integrable functions,
  Logical Methods in Computer Science, volume 13 issue 3 (2017), pages 1-39
• Arno Pauly, F. Steinberg:
  Comparing Representations for Function Spaces in Analysis,
  Theory of Computing Systems 62 (2018), pages 557-582; open access version available here.
• Akitoshi Kawamura, F. Steinberg, Martin Ziegler:
  On the Computational Complexity of the Dirichlet Problem for Poisson's Equation,
  Mathematical Structures in Computer Science, volume 27 issue 8 (2017), pages 1437-1465.

Publications in conference/workshop proceedings:

• Christine Gassner, Arno Pauly, F. Steinberg:
  Computing measure as a primitive operation,
  accepted for presentation at CSL 2021.
• Michal Konecny, F. Steinberg, Holger Thies:
  Computable analysis for verified exact real computation,
  accepted for presentation at FSTTCS 2020.
• Michal Konecny, F. Steinberg, Holger Thies:
  Continuous and monotone machines,
  MFCS 2020.
• Yannick Forster, Dominik Kirst, F. Steinberg:
  Towards Extraction of Continuity Moduli in Coq,
  Types 2020.
• F. Steinberg, Laurent Thery, Holger Thies:
  Quantitative continuity and computable analysis in Coq,
  Interactive Theorem Proving, ITP 2019. Proceedings in LIPICS vol. 141.
• Bruce M. Kapron, F. Steinberg:
  Type-two Iteration with Bounded Query Revision,
  Developments in Implicit Computational complExity, DICE-FOPARA 2019.
• Akitoshi Kawamura, F. Steinberg, Holger Thies:
  Second-order linear-time 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:
  Type-two polynomial-time 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 polynomial-time 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.
• 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
• Matthias Schröder, F. Steinberg, Martin Ziegler:
  Average-Case Bit-Complexity Theory of Real Functions,
  Mathematical aspects of computer and information sciences, MACIS 2015. Proceedings in LNCS vol. 9582.

Preprints:

• Franz Brauße, F. Steinberg: A minimal representation for continuous functions, preprint.