This is the homepage of Florian Steinberg
- Real complexity theory
- Second-order 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 polynomial-time Weihrauch reductions
- Implementations in iRRAM and similar frameworks
- Connections between real complexity theory, numerical analysis and approximation theory
Events of interest:
I am co-organizer 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.
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
Comparing Representations for Function Spaces in Analysis,
Theory of Computing Systems, 1-26, January 2017; arXiv version available at arXiv:1512.03024
Complexity Theory of (Functions on) Compact Metric Spaces,
LICS'16 Proceedings of the 31th 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.
Matthias Schröder ,
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):
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)
Past conference visits:
Past research stays:
Technische Universität Darmstadt
Schloßgartenstr. 7, S2|15 Raum 203
You can find me on github, bitbucket and researchgate.