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

Function Specification Inference Using Craig Interpolation
A. Schremmer, Function Specification Inference Using Craig Interpolation, Universität Paderborn, 2011.
LibreCat: /record/658

Fault attacks in pairing-based cryptography
G. Liske, Fault Attacks in Pairing-Based Cryptography, Universität Paderborn, 2011.
LibreCat: /record/659

Defining and Deploying Complex Applicances in Multi-Site Cloud Environments
M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud Environments, Universität Paderborn, 2011.
LibreCat: /record/660

Coverage Criteria for Testing DMM Specifications
S. Arifulina, Coverage Criteria for Testing DMM Specifications, Universität Paderborn, 2011.
LibreCat: /record/661

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

Complexity Classes for Local Computation
K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011.
LibreCat: /record/663

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

Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord
P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, Universität Paderborn, 2011.
LibreCat: /record/665

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

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

Computing Compressed XML Data from Relational Databases
S. Böttcher, D. Bokermann, R. Hartel, in: Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer Berlin/Heidelberg, 2011, pp. 209–220.
LibreCat: /record/6740

Collisionless Gathering of Robots with an Extent
A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011, pp. 178–189.
LibreCat: /record/16410
DOI: 10.1007/978-3-642-18381-2_15

Bin Packing - How Do I Get My Stuff into the Boxes
J. Gehweiler, F. Meyer auf der Heide, in: Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374.
LibreCat: /record/16412
DOI: 10.1007/978-3-642-15328-0_38

Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA 
R. Rajaraman, F. Meyer auf der Heide, in: 2011.
LibreCat: /record/16428
DOI: 10.1145/1989493

A survey on relay placement with runtime and approximation guarantees
B. Degener, S.P. Fekete, B. Kempkes, F. Meyer auf der Heide, Computer Science Review (2011) 57–68.
LibreCat: /record/16447
DOI: 10.1016/j.cosrev.2010.09.005

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

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

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

Building Simple Formations in Large Societies of Tiny Mobile Robots
B. Degener, B. Kempkes, F. Meyer auf der Heide, Procedia Computer Science (2011) 153–155.
LibreCat: /record/16455
DOI: 10.1016/j.procs.2011.09.049