Eike Neumann

According to our database1, Eike Neumann authored at least 19 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation.
Log. Methods Comput. Sci., 2024

The equational theory of the Weihrauch lattice with multiplication.
CoRR, 2024

2023
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions.
Proceedings of the Reachability Problems - 17th International Conference, 2023

2022
On the computability of the set of automorphisms of the unit square.
Theor. Comput. Sci., 2022

Uniform Envelopes.
Log. Methods Comput. Sci., 2022

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

On Envelopes and Backward Approximations.
Proceedings of the Revolutions and Revelations in Computability, 2022

2021
Decision problems for linear recurrences involving arbitrary real numbers.
Log. Methods Comput. Sci., 2021

Representations and evaluation strategies for feasibly approximable functions.
Comput., 2021

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Decision Problems for Second-Order Holonomic Recurrences.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Parametrised second-order complexity theory with applications to the study of interval computation.
Theor. Comput. Sci., 2020

On Ranking Function Synthesis and Termination for Polynomial Programs.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Universal envelopes of discontinuous functions.
PhD thesis, 2019

Implementing evaluation strategies for continuous real functions.
CoRR, 2019

2018
Computability in Basic Quantum Mechanics.
Log. Methods Comput. Sci., 2018

A topological view on algebraic computation models.
J. Complex., 2018

2017
The Fréchet distance of surfaces is computable.
CoRR, 2017

2015
Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees.
Log. Methods Comput. Sci., 2015


  Loading...