This is the homepage of Florian Steinberg
I am a postdoctoral researcher at INRIA in Sophia-Antipolis.
My PhD project was supervised by Prof. Dr. Martin Ziegler, Prof. Akitoshi Kawamura and Prof. Dr. Ulrich Kohlenbach and funded by the IRTG 1529.
08.06.2018: I will be visiting Professor Hideki Tsuiki in Kyoto for the next two weeks.
08.06.2018: I have just set up a repositiory for what Laurent Thery and I have been proving about Chebychev polynomials in Coq, you can find it here: Cheby.
02.05.2018: Holger, Akitoshi and my paper "Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving" was accepted to the Wollic 2018 conference.
18.04.2018: Bruce Kapron and my paper Type-two polynomial-time and restricted lookahead has been accepted for presentation at LICS 2018.
- 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
- Implementations in iRRAM and similar frameworks
- Connections between real complexity theory, numerical analysis and approximation theory
- coqrep: A coq library for computable analysis.
- Cheby: Formalization of some basic 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.
Bruce M. Kapron,
Type-two polynomial-time and restricted lookahead, extended abstract accepted for LICS 2018.
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 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);
People I cooperated with:
People whose work I am interested in (list evidentely incomplete):
June 2017: Talk at Greifswald University.
Mai 2017: Talk at Aston University.
March 2017: Talk in the research seminar of the working group "Geometrie und Approximation".
February 2017: Seminar talk in the series "Gedanken zur information"
April 2016: At KAIST seminar (slides of my talk)
Past conference visits:
Past research stays:
2004 Route des Lucioles, Building "Fermat", office "F117",
06902 Valbonne, France
Phone: +33 4 92 38 77 95
You can find me on github, bitbucket and researchgate.