default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEike Neumann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Sewon Park
, Franz Brauße, Pieter Collins, SunYoung Kim, Michal Konecný, Gyesik Lee, Norbert Th. Müller, Eike Neumann, Norbert Preining, Martin Ziegler:
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation. Log. Methods Comput. Sci. 20(2) (2024)- [i11]Eike Neumann, Arno Pauly, Cécilia Pradic:
The equational theory of the Weihrauch lattice with multiplication. CoRR abs/2403.13975 (2024) - 2023
- [c6]Eike Neumann:
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. RP 2023: 98-112 - [i10]Eike Neumann:
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. CoRR abs/2307.00363 (2023) - 2022
- [j8]Eike Neumann:
Uniform Envelopes. Log. Methods Comput. Sci. 18(3) (2022) - [j7]Eike Neumann:
On the computability of the set of automorphisms of the unit square. Theor. Comput. Sci. 903: 74-83 (2022) - [c5]Eike Neumann:
On Envelopes and Backward Approximations. CiE 2022: 220-233 - [c4]Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell:
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. MFCS 2022: 39:1-39:14 - [i9]Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell:
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. CoRR abs/2207.01550 (2022) - 2021
- [j6]Michal Konecný, Eike Neumann:
Representations and evaluation strategies for feasibly approximable functions. Comput. 10(1): 63-89 (2021) - [j5]Eike Neumann:
Decision problems for linear recurrences involving arbitrary real numbers. Log. Methods Comput. Sci. 17(3) (2021) - [c3]Eike Neumann, Joël Ouaknine, James Worrell:
Decision Problems for Second-Order Holonomic Recurrences. ICALP 2021: 99:1-99:20 - [c2]Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell:
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. MFCS 2021: 33:1-33:21 - [i8]Eike Neumann:
Uniform Envelopes. CoRR abs/2103.16156 (2021) - [i7]Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell:
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. CoRR abs/2107.02060 (2021) - 2020
- [j4]Eike Neumann, Florian Steinberg:
Parametrised second-order complexity theory with applications to the study of interval computation. Theor. Comput. Sci. 806: 281-304 (2020) - [c1]Eike Neumann, Joël Ouaknine, James Worrell:
On Ranking Function Synthesis and Termination for Polynomial Programs. CONCUR 2020: 15:1-15:15 - [i6]Eike Neumann:
Decision problems for linear recurrences involving arbitrary real numbers. CoRR abs/2008.00583 (2020)
2010 – 2019
- 2019
- [b1]Eike Neumann:
Universal envelopes of discontinuous functions. Aston University, Birmingham, UK, 2019 - [i5]Michal Konecný, Eike Neumann:
Implementing evaluation strategies for continuous real functions. CoRR abs/1910.04891 (2019) - 2018
- [j3]Eike Neumann, Arno Pauly:
A topological view on algebraic computation models. J. Complex. 44: 1-22 (2018) - [j2]Eike Neumann, Martin Pape, Thomas Streicher:
Computability in Basic Quantum Mechanics. Log. Methods Comput. Sci. 14(2) (2018) - 2017
- [i4]Michal Konecný, Eike Neumann:
Representations and evaluation strategies for feasibly approximable functions. CoRR abs/1710.03702 (2017) - [i3]Eike Neumann:
The Fréchet distance of surfaces is computable. CoRR abs/1711.02161 (2017) - [i2]Eike Neumann, Florian Steinberg:
Parametrised second-order complexity theory with applications to the study of interval computation. CoRR abs/1711.10530 (2017) - 2016
- [i1]Eike Neumann, Arno Pauly:
A topological view on algebraic computation models. CoRR abs/1602.08004 (2016) - 2015
- [j1]Eike Neumann:
Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees. Log. Methods Comput. Sci. 11(4) (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-10-07 22:11 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:
