Neumerkel, U. (2008). Systematisches Testen eines Constraint-Systems. ZIDline, 19(19), 30–31. http://hdl.handle.net/20.500.12708/170919 ( reposiTUm)

Neumerkel, U., & Kral, S. (2015). Monotone bedingte Verzweigungen in Logikprogrammen. In Programmiersprachen und Grundlagen der Programmierung (pp. 427–436). Schriftenreihe des Instituts für Computersprachen, TU Wien. http://hdl.handle.net/20.500.12708/56435 ( reposiTUm)

Wielemaker, J., & Neumerkel, U. (2008). Precise Garbage Collection in Prolog. In Proceedings of the 2008 Colloquium on Implementation of Constraint and LOgic Programming Systems (p. 15). http://hdl.handle.net/20.500.12708/52523 ( reposiTUm)

Triska, M., Neumerkel, U., & Wielemaker, J. (2008). A Generalised Finite Domain Constraint Solver for SWI-Prolog. In 22nd Workshop on (Constraint) Logic Programming (p. 89). Technical Report, University Halle-Wittenberg, Institute of Computer Science. http://hdl.handle.net/20.500.12708/52524 ( reposiTUm)

Neumerkel, U., Triska, M., & Wielemaker, J. (2008). Declarative language extensions for prolog courses. In Proceedings of the 2008 international workshop on Functional and declarative programming in education - FDPE ’08. International Conference on Functional Programming, Workshop on Functional and Declarative Programming in Education, Victoria, BC, Canada, Non-EU. ACM Press. https://doi.org/10.1145/1411260.1411271 ( reposiTUm)

Triska, M., Neumerkel, U., & Wielemaker, J. (2008). Better Termination for Prolog with Constraints. In P. Arenas & D. Zanardini (Eds.), 18th Workshop on Logic-based methods in Programming Environments (WLPE’08) (pp. 90–96). http://hdl.handle.net/20.500.12708/52525 ( reposiTUm)

Neumerkel, U. W. (1992). Specialization of prolog programs with partially static goals and binarization [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974 ( reposiTUm)