This is the homepage of Florian Steinberg
I am
News:
Research interests:
 Real complexity theory
 Secondorder complexity theory and its applications to computable analysis
 Computability and complexity theory for partial differential equations
 Efficient representations of function spaces relevant to analysis
 Weihrauch reducibility and in particular polynomialtime Weihrauch reductions
 Implementations in iRRAM and similar frameworks
 Connections between real complexity theory, numerical analysis and approximation theory
Events of interest:
I am coorganizer of the "Doktorandentreff", a biweekly meeting of the PhD students of logic at the Technische Universität Darmstadt.
If you want further information about this meeting feel free to contact me.
travel plans:
Other events:
Publications:

Matthias Schröder, F.Steinberg: Bounded time computation on metric spaces and Banach spaces, accepted for LICS conference 2017; arXiv version available at arXiv:1701.02274

F. Steinberg: Complexity theory for spaces of integrable functions, to appear in Logical Methods in Computer Science

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

Akitoshi Kawamura,
F. Steinberg,
Martin Ziegler:
Complexity Theory of (Functions on) Compact Metric Spaces,
LICS'16 Proceedings of the 31th 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);
People I cooperated with:
People whose work I am interested in (list evidentely incomplete):
Selected talks:
Invited:

March 2017: Talk in the research seminar of the working group "Geometrie und Approximation" 2017.

February 2017: Seminar talk in the series "Gedanken zur information" 2017

April 2016: At KAIST seminar (slides of my talk)
Contributed:
Past conference visits:
Past research stays:
Memberships:
contact:
Mathematik
AG1,
Technische Universität Darmstadt
Schloßgartenstr. 7, S215 Raum 203
D64289 Darmstadt
Phone: +4961511622865
Email: ed.tdatsmradut.kitamehtam@grebniets
You can find me on github, bitbucket and researchgate.