S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “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), 2011, pp. 13–27.
LibreCat: /record/657
DOI: 10.1007/978-3-642-28209-6_3

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

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

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

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

M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” 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

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

J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “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), 2011, pp. 31--40.
LibreCat: /record/664
DOI: 10.1007/978-3-642-31500-8_4

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

S. Drzevitzky and M. Platzner, “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, pp. 58–65.
LibreCat: /record/666
DOI: 10.1109/ReCoSoC.2011.5981499

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

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

A. Cord-Landwehr 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), 2011, no. 6543, pp. 178–189.
LibreCat: /record/16410
DOI: 10.1007/978-3-642-18381-2_15

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

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

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

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “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, pp. 138–149.
LibreCat: /record/16451
DOI: 10.1016/j.tcs.2012.10.056

B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and R. Wattenhofer, “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.
LibreCat: /record/16453
DOI: 10.1145/1989493.1989515

P. Kling and F. Meyer auf der Heide, “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.
LibreCat: /record/16454
DOI: 10.1145/1989493.1989517

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