default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Steinberg 0001
Person information
- affiliation: INRIA Saclay, Palaiseau, France
Other persons with the same name
- Florian Steinberg 0002 — TU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j6]Florian Steinberg, Laurent Théry, Holger Thies:
Computable analysis and notions of continuity in Coq. Log. Methods Comput. Sci. 17(2) (2021)- [c15]Svetlana Selivanova, Florian Steinberg, Holger Thies
, Martin Ziegler:
Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations. CASC 2021: 370-390 - [c14]Christine Gaßner, Arno Pauly, Florian Steinberg:
Computing Measure as a Primitive Operation in Real Number Computation. CSL 2021: 22:1-22:22 - 2020
- [j5]Eike Neumann, Florian Steinberg:
Parametrised second-order complexity theory with applications to the study of interval computation. Theor. Comput. Sci. 806: 281-304 (2020) - [j4]Bruce M. Kapron, Florian Steinberg:
Type-two polynomial-time and restricted lookahead. Theor. Comput. Sci. 813: 1-19 (2020) - [c13]Michal Konecný, Florian Steinberg, Holger Thies:
Computable Analysis for Verified Exact Real Computation. FSTTCS 2020: 50:1-50:18 - [c12]Michal Konecný, Florian Steinberg, Holger Thies:
Continuous and Monotone Machines. MFCS 2020: 56:1-56:16 - [i10]Michal Konecný, Florian Steinberg, Holger Thies:
Continuous and monotone machines. CoRR abs/2005.01624 (2020)
2010 – 2019
- 2019
- [c11]Florian Steinberg, Laurent Théry, Holger Thies:
Quantitative Continuity and Computable Analysis in Coq. ITP 2019: 28:1-28:21 - [c10]Akitoshi Kawamura, Florian Steinberg, Holger Thies:
Second-Order Linear-Time Computability with Applications to Computable Analysis. TAMC 2019: 337-358 - [c9]Bruce M. Kapron, Florian Steinberg:
Type-two Iteration with Bounded Query Revision. DICE-FOPARA@ETAPS 2019: 61-73 - [i9]Florian Steinberg, Laurent Théry, Holger Thies:
Quantitative continuity and computable analysis in Coq. CoRR abs/1904.13203 (2019) - [i8]Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg:
Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). NII Shonan Meet. Rep. 2019 (2019) - 2018
- [j3]Arno Pauly, Florian Steinberg:
Comparing Representations for Function Spaces in Computable Analysis. Theory Comput. Syst. 62(3): 557-582 (2018) - [c8]Bruce M. Kapron, Florian Steinberg:
Type-two polynomial-time and restricted lookahead. LICS 2018: 579-588 - [c7]Akitoshi Kawamura, Florian Steinberg, Holger Thies:
Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. WoLLIC 2018: 223-236 - [i7]Bruce M. Kapron, Florian Steinberg:
Type-two polynomial-time and restricted lookahead. CoRR abs/1801.07485 (2018) - 2017
- [j2]Florian Steinberg:
Complexity theory for spaces of integrable functions. Log. Methods Comput. Sci. 13(3) (2017) - [j1]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
On the computational complexity of the Dirichlet Problem for Poisson's Equation. Math. Struct. Comput. Sci. 27(8): 1437-1465 (2017) - [c6]Matthias Schröder, Florian Steinberg:
Bounded time computation on metric spaces and Banach spaces. LICS 2017: 1-12 - [c5]Akitoshi Kawamura, Florian Steinberg:
Polynomial Running Times for Polynomial-Time Oracle Machines. FSCD 2017: 23:1-23:18 - [i6]Matthias Schröder, Florian Steinberg:
Bounded time computation on metric spaces and Banach spaces. CoRR abs/1701.02274 (2017) - [i5]Franz Brauße, Florian Steinberg:
A minimal representation for continuous functions. CoRR abs/1703.10044 (2017) - [i4]Akitoshi Kawamura, Florian Steinberg:
Polynomial running times for polynomial-time oracle machines. CoRR abs/1704.01405 (2017) - [i3]Eike Neumann, Florian Steinberg:
Parametrised second-order complexity theory with applications to the study of interval computation. CoRR abs/1711.10530 (2017) - 2016
- [c4]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. CiE 2016: 142-152 - [c3]Arno Pauly, Florian Steinberg:
Representations of Analytic Functions and Weihrauch Degrees. CSR 2016: 367-381 - [c2]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Complexity Theory of (Functions on) Compact Metric Spaces. LICS 2016: 837-846 - [i2]Florian Steinberg:
Complexity theory for spaces of integrable functions. CoRR abs/1612.06419 (2016) - 2015
- [c1]Matthias Schröder, Florian Steinberg, Martin Ziegler:
Average-Case Bit-Complexity Theory of Real Functions. MACIS 2015: 505-519 - [i1]Arno Pauly, Florian Steinberg:
Representations of analytic functions and Weihrauch degrees. CoRR abs/1512.03024 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
