Trosolwg
Mae Eike Neumann yn Ddarlithydd yn yr Adran Gyfrifiadureg ym Mhrifysgol Abertawe.
Dr Eike Neumann
Darlithydd,
Computer Science
310
Trydydd Llawr
Y Ffowndri Gyfrifiadol
Campws y Bae
Trydydd Llawr
Y Ffowndri Gyfrifiadol
Campws y Bae
Meysydd Arbenigedd
- Dadansoddi Cyfrifadwy
- Cymhlethdod Cyfrifiadol
- Problemau Cyraeddadwyedd ar gyfer Systemau Dynamegol
Cyhoeddiadau
Uchafbwyntiau Ymchwil
-
Neumann, E. (2022). Uniform Envelopes. Logical Methods in Computer Science, 18(3), 8:1-8:34.
-
Neumann, E. (2022). On the computability of the set of automorphisms of the unit square. Theoretical Computer Science, 903, 74-83.
-
Konečný, M. & Neumann, E. (2021). Representations and evaluation strategies for feasibly approximable functions. Computability, 10(1), 63-89.
-
Neumann, E. (2021). Decision problems for linear recurrences involving arbitrary real numbers. Logical Methods in Computer Science, 17(3), 16:1-16:26.
-
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.
-
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.
-
Neumann, E. & Steinberg, F. (2020). Parametrised second-order complexity theory with applications to the study of interval computation. Theoretical Computer Science, 806, 281-304.
-
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.
-
Neumann, E., Neumann, E., & Pauly, A. (2018). A topological view on algebraic computation models. Journal of Complexity, 44, 1-22.
-
Neumann, E., Pape, M., & Streicher, T. (2018). Computability in Basic Quantum Mechanics. Logical Methods in Computer Science, 14(2)
Holl Ymchwil
Erthyglau Cylchgronau
-
Neumann, E. (2022). Uniform Envelopes. Logical Methods in Computer Science, 18(3), 8:1-8:34.
-
Neumann, E. (2022). On the computability of the set of automorphisms of the unit square. Theoretical Computer Science, 903, 74-83.
-
Neumann, E. (2021). Decision problems for linear recurrences involving arbitrary real numbers. Logical Methods in Computer Science, 17(3), 16:1-16:26.
-
Konečný, M. & Neumann, E. (2021). Representations and evaluation strategies for feasibly approximable functions. Computability, 10(1), 63-89.
-
Neumann, E. & Steinberg, F. (2020). Parametrised second-order complexity theory with applications to the study of interval computation. Theoretical Computer Science, 806, 281-304.
-
Neumann, E., Pape, M., & Streicher, T. (2018). Computability in Basic Quantum Mechanics. Logical Methods in Computer Science, 14(2)
-
Neumann, E., Neumann, E., & Pauly, A. (2018). A topological view on algebraic computation models. Journal of Complexity, 44, 1-22.
-
Neumann, E. (2015). Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees. Logical Methods in Computer Science, 11(4)
Cyfraniadau Cynadleddau
-
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.
-
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.
-
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.
-
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.
Modiwlau a Addysgir
-
CSC364 Software Testing
Testing is the process of systematically experimenting with an object (the SUT = System Under Test) in order to establish its quality, where quality means the degree of accordance to the intention or specification. This module will cover various test scenarios; practical exercises will allow the students to gain hands-on experience.
-
CSCM64 Software Testing
Testing is the process of systematically experimenting with an object (the SUT = System Under Test) in order to establish its quality, where quality means the degree of accordance to the intention or specification. This module will provide an in-depth introduction to various test scenarios and enable students to gain hands-on experience by means of a number of practical exercises.