Abshoff S, Cord-Landwehr A, Degener B, Kempkes B, Pietrzyk P. Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In: Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS). LNCS. ; 2011:13-27. doi:10.1007/978-3-642-28209-6_3

Schremmer A. Function Specification Inference Using Craig Interpolation. Universität Paderborn; 2011.

Liske G. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn; 2011.

Peuster M. Defining and Deploying Complex Applicances in Multi-Site Cloud Environments. Universität Paderborn; 2011.

Arifulina S. Coverage Criteria for Testing DMM Specifications. Universität Paderborn; 2011.

Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing Skip List. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370. doi:10.1007/978-3-642-24550-3_27

Swierkot K. Complexity Classes for Local Computation. Universität Paderborn; 2011.

Gehweiler J, Kling P, Meyer auf der Heide F. An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM). LNCS. ; 2011:31--40. doi:10.1007/978-3-642-31500-8_4

Wette P. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn; 2011.

Drzevitzky S, Platzner M. Achieving Hardware Security for Reconû01gurable Systems on Chip by a Proof-Carrying Code Approach. In: Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC). ; 2011:58-65. doi:10.1109/ReCoSoC.2011.5981499

Meyer auf der Heide F, Rajaraman R, eds. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures.; 2011. doi:10.1145/1989493

Böttcher S, Bokermann D, Hartel R. Computing Compressed XML Data from Relational Databases. In: Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers. Vol 7051. Lecture Notes in Computer Science. Springer Berlin/Heidelberg; 2011:209-220.

Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011). Springer; 2011:178-189. doi:10.1007/978-3-642-18381-2_15

Gehweiler J, Meyer auf der Heide F. Bin Packing - How Do I Get My Stuff into the Boxes. In: Algorithms Unplugged. Berlin, Heidelberg; 2011:367-374. doi:10.1007/978-3-642-15328-0_38

Rajaraman R, Meyer auf der Heide F. Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. In: ; 2011. doi:10.1145/1989493

Degener B, Fekete SP, Kempkes B, Meyer auf der Heide F. A survey on relay placement with runtime and approximation guarantees. Computer Science Review. 2011:57-68. doi:10.1016/j.cosrev.2010.09.005

Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-efficient strategies for building short chains of mobile robots locally. In: SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity. ; 2011:138-149. doi:10.1016/j.tcs.2012.10.056

Degener B, Kempkes B, Langner T, Meyer auf der Heide F, Pietrzyk P, Wattenhofer R. A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989515

Kling P, Meyer auf der Heide F. Convergence of local communication chain strategies via linear transformations. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989517

Degener B, Kempkes B, Meyer auf der Heide F. Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science. 2011:153-155. doi:10.1016/j.procs.2011.09.049