Eike Neumann

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 25

Top Topics

Decision Problems

Dynamical Systems

Top Venues

Log. Methods Comput. Sci.

Theor. Comput. Sci.

Publications

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)
Eike Neumann, Arno Pauly, Cécilia Pradic
The equational theory of the Weihrauch lattice with multiplication. CoRR (2024)
Eike Neumann
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. CoRR (2023)
Eike Neumann
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. RP (2023)
Eike Neumann
Uniform Envelopes. Log. Methods Comput. Sci. 18 (3) (2022)
Eike Neumann
On Envelopes and Backward Approximations. CiE (2022)
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)
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 (2022)
Eike Neumann
On the computability of the set of automorphisms of the unit square. Theor. Comput. Sci. 903 (2022)
Eike Neumann
Uniform Envelopes. CoRR (2021)
Eike Neumann
Decision problems for linear recurrences involving arbitrary real numbers. Log. Methods Comput. Sci. 17 (3) (2021)
Eike Neumann, Joël Ouaknine, James Worrell
Decision Problems for Second-Order Holonomic Recurrences. ICALP (2021)
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)
Michal Konecný, Eike Neumann
Representations and evaluation strategies for feasibly approximable functions. Comput. 10 (1) (2021)
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 (2021)
Eike Neumann, Florian Steinberg
Parametrised second-order complexity theory with applications to the study of interval computation. Theor. Comput. Sci. 806 (2020)
Eike Neumann
Decision problems for linear recurrences involving arbitrary real numbers. CoRR (2020)
Eike Neumann, Joël Ouaknine, James Worrell
On Ranking Function Synthesis and Termination for Polynomial Programs. CONCUR (2020)
Michal Konecný, Eike Neumann
Implementing evaluation strategies for continuous real functions. CoRR (2019)
Eike Neumann, Martin Pape, Thomas Streicher
Computability in Basic Quantum Mechanics. Log. Methods Comput. Sci. 14 (2) (2018)
Eike Neumann, Arno Pauly
A topological view on algebraic computation models. J. Complex. 44 (2018)
Eike Neumann
The Fréchet distance of surfaces is computable. CoRR (2017)
Michal Konecný, Eike Neumann
Representations and evaluation strategies for feasibly approximable functions. CoRR (2017)
Eike Neumann, Florian Steinberg
Parametrised second-order complexity theory with applications to the study of interval computation. CoRR (2017)
Eike Neumann, Arno Pauly
A topological view on algebraic computation models. CoRR (2016)
Eike Neumann
Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees. Log. Methods Comput. Sci. 11 (4) (2015)