Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving A Kawamura, F Steinberg, H Thies International Workshop on Logic, Language, Information, and Computation, 223-236, 2018 | 20 | 2018 |
Complexity theory for spaces of integrable functions F Steinberg Logical Methods in Computer Science 13, 2017 | 17 | 2017 |
Complexity theory of (functions on) compact metric spaces A Kawamura, F Steinberg, M Ziegler Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 15 | 2016 |
On the computational complexity of the Dirichlet Problem for Poisson's Equation A Kawamura, F Steinberg, M Ziegler Mathematical Structures in Computer Science 27 (8), 1437-1465, 2017 | 13 | 2017 |
Comparing representations for function spaces in computable analysis A Pauly, F Steinberg Theory of Computing Systems 62 (3), 557-582, 2018 | 12 | 2018 |
Computational complexity theory for advanced function spaces in analysis F Steinberg Technische Universität, 2017 | 12 | 2017 |
Computable analysis and notions of continuity in Coq F Steinberg, L Thery, H Thies Logical Methods in Computer Science 17, 2021 | 9 | 2021 |
Parametrised second-order complexity theory with applications to the study of interval computation E Neumann, F Steinberg Theoretical Computer Science 806, 281-304, 2020 | 9 | 2020 |
Type-two polynomial-time and restricted lookahead BM Kapron, F Steinberg Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 9 | 2018 |
Bounded time computation on metric spaces and Banach spaces M Schröder, F Steinberg 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 9 | 2017 |
A minimal representation for continuous functions F Brauße, F Steinberg arXiv preprint arXiv:1703.10044, 2017 | 8 | 2017 |
Exact real computation of solution operators for linear analytic systems of partial differential equations S Selivanova, F Steinberg, H Thies, M Ziegler Computer Algebra in Scientific Computing: 23rd International Workshop, CASC …, 2021 | 7 | 2021 |
Quantitative continuity and computable analysis in Coq F Steinberg, L Théry, H Thies | 7 | 2019 |
Polynomial running times for polynomial-time oracle machines A Kawamura, F Steinberg arXiv preprint arXiv:1704.01405, 2017 | 7 | 2017 |
Complexity of Laplace’s and Poisson’s Equation A Kawamura, F Steinberg, M Ziegler Bulletin of Symbolic Logic 20 (2), 231, 2014 | 7 | 2014 |
Towards computational complexity theory on advanced function spaces in analysis A Kawamura, F Steinberg, M Ziegler Conference on Computability in Europe, 142-152, 2016 | 6 | 2016 |
Computable analysis for verified exact real computation M Konečný, F Steinberg, H Thies Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020 | 5 | 2020 |
Second-order linear-time computability with applications to computable analysis A Kawamura, F Steinberg, H Thies Theory and Applications of Models of Computation: 15th Annual Conference …, 2019 | 5 | 2019 |
Representations of analytic functions and weihrauch degrees A Pauly, F Steinberg International Computer Science Symposium in Russia, 367-381, 2016 | 4 | 2016 |
Type-two iteration with bounded query revision BM Kapron, F Steinberg arXiv preprint arXiv:1908.04923, 2019 | 3 | 2019 |