Florian Steinberg

From MaRDI portal
(Redirected from Person:831998)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Computing measure as a primitive operation in real number computation2026-03-23Paper
Computable analysis for verified exact real computation2026-03-23Paper
Quantitative continuity and Computable Analysis in Coq2023-02-03Paper
Continuous and monotone machines
(available as arXiv preprint)
2022-07-18Paper
Exact real computation of solution operators for linear analytic systems of partial differential equations2022-03-24Paper
Computable analysis and notions of continuity in \textsc{Coq}
(available as arXiv preprint)
2021-05-25Paper
Computable analysis and notions of continuity in \textsc{Coq}2021-05-25Paper
Type-two polynomial-time and restricted lookahead
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
2021-01-20Paper
Bounded time computation on metric spaces and Banach spaces2021-01-19Paper
Bounded time computation on metric spaces and Banach spaces
(available as arXiv preprint)
2021-01-19Paper
Polynomial Running Times for Polynomial-Time Oracle Machines
(available as arXiv preprint)
2020-05-26Paper
Type-two polynomial-time and restricted lookahead
Theoretical Computer Science
2020-04-21Paper
Parametrised second-order complexity theory with applications to the study of interval computation
Theoretical Computer Science
2020-01-16Paper
Parametrised second-order complexity theory with applications to the study of interval computation
Theoretical Computer Science
2020-01-16Paper
Second-order linear-time computability with applications to computable analysis2019-10-15Paper
Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving2018-10-18Paper
Comparing representations for function spaces in computable analysis
Theory of Computing Systems
2018-06-01Paper
Complexity theory of (functions on) compact metric spaces
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
2018-04-23Paper
On the computational complexity of the Dirichlet problem for Poisson's equation
Mathematical Structures in Computer Science
2017-11-22Paper
Complexity theory for spaces of integrable functions
(available as arXiv preprint)
2017-10-12Paper
Computational complexity theory for advanced function spaces in analysis2017-06-30Paper
Computational complexity theory for advanced function spaces in analysis2017-06-30Paper
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
Pursuit of the Universal
2016-08-17Paper
Representations of analytic functions and Weihrauch degrees
Computer Science – Theory and Applications
2016-07-25Paper
Average-case bit-complexity theory of real functions
Mathematical Aspects of Computer and Information Sciences
2016-05-25Paper


Research outcomes over time


This page was built for person: Florian Steinberg