This is the homepage of Florian Steinberg
I am a postdoctoral researcher at INRIA in Saclay.
My PhD project was supervised by Prof. Dr. Martin Ziegler, Prof. Akitoshi Kawamura and Prof. Dr. Ulrich Kohlenbach and funded by the IRTG 1529.
- 04.07.2019: Thanks to all the participants of the "facets of realizability" workshop. You made it a very pleasant experience.
- 03.06.2019: The workshop "facets of realizability" which Valentin Blot and I are organizing is coming up! Check out the details on the workshop's webpage.
- 02.06.2019: A short version of the paper "Quantitative continuity and computable analysis in Coq" was accepted for presentation at ITP 2019.
- Second-order complexity theory and its applications to computable analysis
- Computability and complexity theory for partial differential equations
- Formal proofs and program extraction in particular for computation on infinite data
- Weihrauch reducibility and polynomial-time Weihrauch reductions
- Computable analysis based software: iRRAM , AERN, Ariadne etc.
- Connections between real complexity theory, numerical analysis and approximation theory
- incone: Information theoretic continuity.
- coqrep: Some more experimental extensions of the incone library, currently based on an old version of incone.
- Cheby: Formalization of results about Chebychev approximation.
- iRRAM analytic: An iRRAM library for analytic functions and ODE solving.
Events of interest:
The annual conferences CCA, CCC and LICS.
F. Steinberg, Laurent Thery, Holger Thies:
Quantitative continuity and computable analysis in Coq, short version accepted for presentation at ITP 2019.
- Eike Neumann, Florian Steinberg:
Parametrised second-order complexity theory with applications to the study of interval computation,
Theoretical Computer Science, 2019, arXiv version available at arXiv:1711.10530 .
- Bruce M. Kapron, F. Steinberg:
Type-two Iteration with Bounded Query Revision,
accepted for presentation at 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,
- 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.
Lecture Notes in Computer Science, vol 10944.
Springer, Berlin, Heidelberg.
Bruce M. Kapron, F. Steinberg:
Type-two polynomial-time and restricted lookahead,
LICS '18 Proceedings of the 33rd Anual ACM/IEEE Symposiun on Logic in Computer Science.
ACM, New York, NY, USA, 579-588.
DOI: 10.1145/3209108.3209124 .
Akitoshi Kawamura, F. Steinberg:
Polynomial running times for polynomial-time oracle machines,
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, pages 23:1-18, FSCD conference 2017.
Matthias Schröder, F. Steinberg:
Bounded time computation on metric spaces and Banach spaces,
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. 1-39
Comparing Representations for Function Spaces in Analysis,
Theory of Computing Systems, 1-26, January 2017; open access version available here.
Complexity Theory of (Functions on) Compact Metric Spaces,
LICS'16 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. Pages 837-846
Towards Comptational Complexity Theory on Advanced Function Spaces in Analysis,
Springer LNCS vol. 9709, Pursuit of the Universal: 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, Proceedings.
Average-Case Bit-Complexity Theory of Real Functions,
Springer LNCS vol. 9582, Mathematical aspects of computer and information sciences: 6th international conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, revised selected papers
Representations of analytic functions and Weihrauch degrees,
Springer LNCS vol. 9691, Computer Science - Theory and Applications, 11th international Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings; arXiv version available at arXiv:1512.03024
On the Computational Complexity of the Dirichlet Problem for Poisson's Equation,
Mathematical Structures in Computer Science, 1:1-29, July 2016;
abstract p.231 in Proc. Logic Colloquium 2013 Bulletin of Symbolic Logic vol. 20:2 (2014);
- 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"
Talks during visits:
- February 2019: at Kyushu University.
- Janurary 2019: at LORIA in Nancy.
- Mai 2018: at the LIPN in Paris 13.
- June 2017: at Greifswald University.
- Mai 2017: at Aston University.
- April 2016: at KAIST seminar (slides of my talk)
When I am not at the office:
I am probably doing a research visit.
Here is a list of my past ones:
Bat 650, Rue Noetzlin,
91190 Gif-sur-Yvette, France
Phone: None I know of
You can find me on github, bitbucket and researchgate.