Florian Steinberg

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Factorize Factorization	2021	Christine Gaßner Arno Pauly Florian Steinberg
+	Continuous and monotone machines	2020	M Konĕcný Florian Steinberg Holger Thies
+ PDF Chat	Quantitative continuity and Computable Analysis in Coq	2019	Florian Steinberg Laurent Théry Holger Thies
+	Type-two polynomial-time and restricted lookahead	2019	Bruce M. Kapron Florian Steinberg
+	Parametrised second-order complexity theory with applications to the study of interval computation	2019	Eike Neumann Florian Steinberg
+ PDF Chat	Some formal proofs of isomorphy and discontinuity	2019	Florian Steinberg Holger Thies
+	Towards computational complexity theory on advanced function spaces in analysis	2019	Akitoshi Kawamura Florian Steinberg Martin Ziegler
+	Computable analysis and notions of continuity in Coq	2019	Florian Steinberg Laurent Théry Holger Thies
+ PDF Chat	Type-two polynomial-time and restricted lookahead	2018	Bruce M. Kapron Florian Steinberg
+	Complexity theory for spaces of integrable functions	2017	Florian Steinberg
+	Polynomial Running Times for Polynomial-Time Oracle Machines	2017	Akitoshi Kawamura Florian Steinberg
+	Bounded time computation on metric spaces and banach spaces	2017	Matthias Schröder Florian Steinberg
+ PDF Chat	Bounded time computation on metric spaces and Banach spaces	2017	Matthias Schröder Florian Steinberg
+	Polynomial running times for polynomial-time oracle machines	2017	Akitoshi Kawamura Florian Steinberg
+	Bounded time computation on metric spaces and Banach spaces	2017	Matthias Schröder Florian Steinberg
+	On the computational complexity of the Dirichlet Problem for Poisson's Equation	2016	Akitoshi Kawamura Florian Steinberg Martin Ziegler
+ PDF Chat	Representations of Analytic Functions and Weihrauch Degrees	2016	Arno Pauly Florian Steinberg
+	Complexity theory for spaces of integrable functions	2016	Florian Steinberg
+	Towards computational complexity theory on advanced function spaces in analysis	2016	Akitoshi Kawamura Florian Steinberg Martin Ziegler
+	Representations of analytic functions and Weihrauch degrees	2015	Arno Pauly Florian Steinberg
+	Holding their ground—secure land tenure for the urban poor in developing countries	2003	Florian Steinberg

Common Coauthors

Coauthor	Papers Together
Akitoshi Kawamura	5
Holger Thies	4
Arno Pauly	3
Martin Ziegler	3
Matthias Schröder	3
Laurent Théry	2
Bruce M. Kapron	2
Eike Neumann	1
M Konečný	1
Christine Gaßner	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Complexity Theory for Operators in Analysis	2012	Akitoshi Kawamura Stephen Cook	8
+ PDF Chat	Polynomial and abstract subrecursive classes	1976	Kurt Mehlhorn	7
+	Small Complexity Classes for Computable Analysis	2014	Akitoshi Kawamura Hiroyuki Ota	5
+ PDF Chat	Function Spaces for Second-Order Polynomial Time	2014	Akitoshi Kawamura Arno Pauly	4
+	Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey’s hierarchy	2015	Akitoshi Kawamura Norbert Müller Carsten Rösnick Martin Ziegler	4
+	Computational complexity on computable metric spaces	2003	Klaus Weirauch	3
+	Some computational aspects of metric fixed-point theory	2005	Ulrich Kohlenbach	3
+	Computable analysis of the abstract Cauchy problem in a Banach space and its applications I	2007	Klaus Weihrauch Ning Zhong	3
+	Computational complexity of real functions	1982	Ker‐I Ko Harvey M. Friedman	3
+	Towards computability of elliptic boundary value problems in variational formulation	2006	Vasco Brattka Atsushi Yoshikawa	3
+	On Computability of Navier-Stokes’ Equation	2015	Shu Ming Sun Ning Zhong Martin Ziegler	3
+	Computability of Banach space principles	2001	Vasco Brattka	2
+	Computability theory of generalized functions	2003	Ning Zhong Klaus Weihrauch	2
+	Complexity theory for spaces of integrable functions	2017	Florian Steinberg	2
+ PDF Chat	Some hierarchies of <tt>QCB</tt><sub>0</sub>-spaces	2014	Matthias Schröder Victor Selivanov	2
+ PDF Chat	Adventures in time and space	2007	Norman Danner James S. Royer	2
+ PDF Chat	Some applications of logic to feasibility in higher types	2004	Aleksandar Ignjatović Arun Sharma	2
+	An effective Riemann Mapping Theorem	1999	Peter Hertling	2
+ PDF Chat	Effective Choice and Boundedness Principles in Computable Analysis	2011	Vasco Brattka Guido Gherardi	2
+ PDF Chat	Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete	2010	Akitoshi Kawamura	2
+	Applied Proof Theory: Proof Interpretations and Their Use in Mathematics	2008	Ulrich Kohlenbach	2
+	ε-Entropy and ε-Capacity of Sets In Functional Spaces	1993	V. М. Tikhomirov	2
+	Comparing Cartesian closed categories of (core) compactly generated spaces	2004	Martı́n Hötzel Escardó Jimmie Lawson Alex Simpson	2
+ PDF Chat	A counterexample to the approximation problem in Banach spaces	1973	Per Enflo	2
+	On the Computational Complexity of Positive Linear Functionals on C [0;1].	2015	Hugo Férée Martin Ziegler	2
+ PDF Chat	On the computational complexity of the Riemann mapping	2007	Ilia Binder Mark Braverman Michael Yampolsky	2
+	Complexity theory for spaces of integrable functions	2016	Florian Steinberg	2
+	Polynomial Running Times for Polynomial-Time Oracle Machines	2017	Akitoshi Kawamura Florian Steinberg	2
+	Bounded time computation on metric spaces and banach spaces	2017	Matthias Schröder Florian Steinberg	1
+	Über die Orthogonalfunktionen des Herrn Haar.	1910	Georg Faber	1
+ PDF Chat	Essential Incompleteness of Arithmetic Verified by Coq	2005	Russell O’Connor	1
+ PDF Chat	Type-two Iteration with Bounded Query Revision	2019	Bruce M. Kapron Florian Steinberg	1
+ PDF Chat	Computational Complexity of Smooth Differential Equations	2014	Akitoshi Kawamura Hiroyuki Ota Carsten Rösnick Martin Ziegler	1
+	On the Effective Existence of Schauder Bases.	2009	Volker Bosserhoff	1
+ PDF Chat	Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems	2013	Olivier Bournez Daniel S. Graça Amaury Pouly Ning Zhong	1
+	Theory of Approximation of Functions of a Real Variable	1963	A.F. TIMAN	1
+	Functional Analysis, Sobolev Spaces and Partial Differential Equations	2010	Haı̈m Brezis	1
+	Infinite Oracle Queries in Type-2 Machines (Extended Abstract)	2009	Arno Pauly	1
+	Real and Complex Analysis.	1987	G. A. Garreau Walter Rudin	1
+	Weihrauch-completeness for layerwise computability	2015	Arno Pauly Willem L. Fouché George Davie	1
+	Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime	2012	Akitoshi Kawamura Norbert Müller Carsten Rösnick Martin Ziegler	1
+ PDF Chat	Elliptic Partial Differential Equations of Second Order	2001	David Gilbarg Neil S. Trudinger	1
+	Computational complexity of solving polynomial differential equations over unbounded domains	2016	Amaury Pouly Daniel S. Graça	1
+	Derivatives of Computable Functions	1998	Ning Zhong	1
+ PDF Chat	Probabilistic computability and choice	2015	Vasco Brattka Guido Gherardi Rupert Hölzl	1
+ PDF Chat	Closed choice and a Uniform Low Basis Theorem	2012	Vasco Brattka Matthew de Brecht Arno Pauly	1
+	Elliptische Differentialgleichungen zweiter Ordnung	2009	Ernst Wienholtz Hubert Kalf Thomas Kriecherbauer	1
+	Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact	2001	Salah Labhalla Henri Lombardi El Madkour Moutai	1
+	An Algorithm for Computing Fundamental Solutions	2006	Klaus Weihrauch Ning Zhong	1
+ PDF Chat	On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines	1989	Lenore Blum M. Shub Steve Smale	1