Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees. - Eike Neumann (Log. Methods Comput. Sci., 2015)

The Fréchet distance of surfaces is computable. - Eike Neumann (CoRR, 2017)

A topological view on algebraic computation models. - Eike Neumann; Arno Pauly (J. Complex., 2018)

Computability in Basic Quantum Mechanics. - Eike Neumann; Martin Pape; Thomas Streicher (Log. Methods Comput. Sci., 2018)

Implementing evaluation strategies for continuous real functions. - Michal Konecný; Eike Neumann (CoRR, 2019)

Universal envelopes of discontinuous functions. - Eike Neumann (2019)

On Ranking Function Synthesis and Termination for Polynomial Programs. - Eike Neumann; Joël Ouaknine; James Worrell 001 (CONCUR, 2020)

Parametrised second-order complexity theory with applications to the study of interval computation. - Eike Neumann; Florian Steinberg 001 (Theor. Comput. Sci., 2020)

Decision Problems for Second-Order Holonomic Recurrences. - Eike Neumann; Joël Ouaknine; James Worrell 001 (ICALP, 2021)

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. - Julian D'Costa; Engel Lefaucheux; Eike Neumann; Joël Ouaknine; James Worrell 001 (MFCS, 2021)

Representations and evaluation strategies for feasibly approximable functions. - Michal Konecný; Eike Neumann (Comput., 2021)

Decision problems for linear recurrences involving arbitrary real numbers. - Eike Neumann (Log. Methods Comput. Sci., 2021)

On Envelopes and Backward Approximations. - Eike Neumann (CiE, 2022)

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. - Julian D'Costa; Engel Lefaucheux; Eike Neumann; Joël Ouaknine; James Worrell 001 (MFCS, 2022)

Uniform Envelopes. - Eike Neumann (Log. Methods Comput. Sci., 2022)

On the computability of the set of automorphisms of the unit square. - Eike Neumann (Theor. Comput. Sci., 2022)

On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. - Eike Neumann (RP, 2023)

The equational theory of the Weihrauch lattice with multiplication. - Eike Neumann; Arno Pauly; Cécilia Pradic (CoRR, 2024)

Semantics, Specification Logic, and Hoare Logic of Exact Real Computation. - Sewon Park 001; Franz Brauße; Pieter Collins; SunYoung Kim; Michal Konecný; Gyesik Lee; Norbert Th. Müller; Eike Neumann; Norbert Preining; Martin Ziegler 001 (Log. Methods Comput. Sci., 2024)

Represented Spaces of Represented Spaces. - Johanna Franklin; Eike Neumann; Arno Pauly; Cécilia Pradic; Manlio Valenti (CiE, 2025)

Computably Discrete Represented Spaces. - Eike Neumann; Arno Pauly; Cécilia Pradic; Manlio Valenti (CiE, 2025)

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space. - Eike Neumann (MFCS, 2025)