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

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

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

Compositional CSP Traces Refinement Checking
H. Wehrheim, D. Wonisch, Electr. Notes Theor. Comput. Sci. (2009) 135--151.

Static Class Elements for Object-Z
T. Ruhroth, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2009) 193--205.

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

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

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

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

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

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

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

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

Sampling methods for shortest vectors, closest vectors and successive minima
J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.

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

On the Analysis of Cryptographic Assumptions in the Generic Ring Model
T. Jager, J. Schwenk, 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.

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

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

Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)
P. Briest, It - Information Technology 51 (2009) 62–65.

Foreword
R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.