This is the homepage of Florian Steinberg
I am a postdoctoral researcher at INRIA in SophiaAntipolis.
My PhD project was supervised by Prof. Dr. Martin Ziegler, Prof. Akitoshi Kawamura and Prof. Dr. Ulrich Kohlenbach and funded by the IRTG 1529.
News:

18.04.2018: Bruce Kapron and my paper Typetwo polynomialtime and restricted lookahead has been accepted for presentation at LICS 2018.

23.03.2018: I've recently been working on a library for doing computable analysis in Coq. You can take a look at the github repositiory. It is very much a work in progress, so I am happy about any kind of feedback.
Research interests:
 Secondorder 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 polynomialtime Weihrauch reductions
 Implementations in iRRAM and similar frameworks
 Connections between real complexity theory, numerical analysis and approximation theory
Events of interest:
The annual conferences CCA, CCC and LICS.
Travel plans:
Publications:

Bruce M. Kapron,
F. Steinberg:
Typetwo polynomialtime and restricted lookahead, extended abstract accepted for LICS 2018.

Akitoshi Kawamura, F. Steinberg Polynomial running times for polynomialtime oracle machines,
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, pages 23:118 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. 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,
LICS'16 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. Pages 837846

Akitoshi Kawamura,
F. Steinberg,
Martin Ziegler:
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.

Matthias Schröder,
F. Steinberg,
Martin Ziegler:
AverageCase BitComplexity Theory of Real Functions,
Springer LNCS vol. 9582, Mathematical aspects of computer and information sciences: 6th international conference, MACIS 2015, Berlin, Germany, November 1113, 2015, revised selected papers

Arno Pauly,
F. Steinberg:
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 913, 2016, Proceedings; arXiv version available at arXiv:1512.03024

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;
abstract p.231 in Proc. Logic Colloquium 2013 Bulletin of Symbolic Logic vol. 20:2 (2014);
Preprints:
People I cooperated with:
People whose work I am interested in (list evidentely incomplete):
Selected talks:
Invited:

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)
Contributed:
Past conference visits:
Past research stays:
Memberships:
contact:
Team Marelle
2004 Route des Lucioles, Building "Fermat", office "F117",
06902 Valbonne, France
Phone: +33 4 92 38 77 95
Email: rf.airni@grebniets.nairolf
You can find me on github, bitbucket and researchgate.