D. Deveci, M. Kortenjan, and G. Schomaker, “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions,” in  Parallel and Distributed Computing and Systems, Nr. 21, 2009.

J. Stradner, H. Hamann, T. Schmickl, and K. Crailsheim, “Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware,” in 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009.

T. Schmickl, H. Hamann, H. Wörn, and K. Crailsheim, “Two different approaches to a macroscopic model of a bio-inspired robotic swarm,” Robotics and Autonomous Systems, vol. 6, no. 9, pp. 913–921, 2009.

H. Hamann, I. Troch, and F. Breitenecker, “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System,” in MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.

H. Wehrheim and D. Wonisch, “Compositional CSP Traces Refinement Checking,” Electr. Notes Theor. Comput. Sci., no. 2, pp. 135--151, 2009.

T. Ruhroth and H. Wehrheim, “Static Class Elements for Object-Z,” Electr. Notes Theor. Comput. Sci., pp. 193--205, 2009.

T. Ruhroth, H. Voigt, and H. Wehrheim, “Measure, Diagnose, Refactor: A Formal Quality Cycle for Software Models,” in 35th Euromicro Conference on Software Engineering and Advanced Applications, SEAA 2009, Patras, Greece, August 27-29, 2009, Proceedings, 2009, pp. 360--367.

M. Leuschel and H. Wehrheim, Eds., Integrated Formal Methods, 7th International Conference, IFM 2009, D\'22usseldorf, Germany, February 16-19, 2009. Proceedings. 2009.

C. Schröer, Hierarchisches Clustering mit minimalen Cluster-Durchmessern. 2009.

G. Liske, Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens. 2009.

C. Scholz, Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen. 2009.

M. R. Ackermann, Algorithms for the Bregman k-Median Problem. Universität Paderborn, 2009.

S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 300–301.

M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097.

J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, no. 18, pp. 1648–1665, 2009.

J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.

T. Jager and J. Schwenk, “On the Analysis of Cryptographic Assumptions in the Generic Ring Model,” in Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings, 2009, pp. 399--416.

M. Meyer, Musterbasiertes Re-Engineering von Softwaresystemen. Universitaetsbibliothek Paderborn, 2009.

F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,” Public Service Review: Science and Technology, vol. 04, 2009.

P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” it - Information Technology, vol. 51, no. 1, pp. 62–65, 2009.