Dr Eike Neumann

Research Highlights

1. Neumann, E. (2023). On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. In Olivier Bournez, Enrico Formenti, Igor Potapov (Ed.), Lecture Notes in Computer Science (pp. 98-112). Springer Nature Switzerland

   https://doi.org/10.1007/978-3-031-45286-4_8, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa64077

   http://dx.doi.org/10.1007/978-3-031-45286-4_8
2. D'Costa, J., Engel, L., Neumann, E., Ouaknine, J., & Worrell, J. (2022). Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. In LIPIcs, MFCS 2022Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany.

   https://doi.org/10.4230/LIPIcs.MFCS.2022.39, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa61278

   https://drops.dagstuhl.de/opus/volltexte/2022/16797/
3. Neumann, E. (2022). Uniform Envelopes. Logical Methods in Computer Science, 18(3), 8:1-8:34.

   https://doi.org/10.46298/lmcs-18(3:8)2022, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60705
4. Neumann, E. (2022). On the computability of the set of automorphisms of the unit square. Theoretical Computer Science, 903, 74-83.

   https://doi.org/10.1016/j.tcs.2021.12.019, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60148
5. Konečný, M. & Neumann, E. (2021). Representations and evaluation strategies for feasibly approximable functions. Computability, 10(1), 63-89.

   https://doi.org/10.3233/com-180234, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60147
6. Neumann, E. (2021). Decision problems for linear recurrences involving arbitrary real numbers. Logical Methods in Computer Science, 17(3), 16:1-16:26.

   https://doi.org/10.46298/lmcs-17(3:16)2021, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60145
7. Neumann, E., Ouaknine, J., & Worrell, J. (2021). Decision Problems for Second-Order Holonomic Recurrences. In Nikhil Bansal, Emanuela Merelli, James Worrell (Ed.), 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (pp. 99:1-99:20). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.

   https://doi.org/10.4230/LIPIcs.ICALP.2021.99, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60144

   https://drops.dagstuhl.de/opus/volltexte/2021/14168
8. Lefaucheux, E., D'Costa, J., Neumann, E., Ouaknine, J., & Worrell, J. (2021). On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. In Bonchi, Filippo and Puglisi, Simon J. (Ed.), 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (pp. 33:1-33:21). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.

   https://doi.org/10.4230/LIPIcs.MFCS.2021.33, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60143

   https://drops.dagstuhl.de/opus/volltexte/2021/14473
9. Neumann, E. & Steinberg, F. (2020). Parametrised second-order complexity theory with applications to the study of interval computation. Theoretical Computer Science, 806, 281-304.

   https://doi.org/10.1016/j.tcs.2019.05.009, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60142
10. Neumann, E., Ouaknine, J., & Worrell, J. (2020). On Ranking Function Synthesis and Termination for Polynomial Programs. In Igor Konnov and Laura Kovács (Ed.), 31st International Conference on Concurrency Theory (CONCUR 2020)Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.

    https://doi.org/10.4230/LIPIcs.CONCUR.2020.15, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60141

All Research