Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.”10.1007/978-3-642-28209-6_3__Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27, doi:10.1007/978-3-642-28209-6_3.
LibreCat: /record/657
DOI: 10.1007/978-3-642-28209-6_3

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

Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.”10.1007/978-3-642-31500-8_4__Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40, doi:10.1007/978-3-642-31500-8_4.
LibreCat: /record/664
DOI: 10.1007/978-3-642-31500-8_4

Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493.
LibreCat: /record/667
DOI: 10.1145/1989493

Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.”10.1007/978-3-642-18381-2_15__37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), no. 6543, Springer, 2011, pp. 178–89, doi:10.1007/978-3-642-18381-2_15.
LibreCat: /record/16410
DOI: 10.1007/978-3-642-18381-2_15

Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.”10.1007/978-3-642-15328-0_38__Algorithms Unplugged, 2011, pp. 367–74, doi:10.1007/978-3-642-15328-0_38.
LibreCat: /record/16412
DOI: 10.1007/978-3-642-15328-0_38

Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. 2011, doi:10.1145/1989493.
LibreCat: /record/16428
DOI: 10.1145/1989493

Degener, Bastian, et al. “A Survey on Relay Placement with Runtime and Approximation Guarantees.”10.1016/j.cosrev.2010.09.005__Computer Science Review, 2011, pp. 57–68, doi:10.1016/j.cosrev.2010.09.005.
LibreCat: /record/16447
DOI: 10.1016/j.cosrev.2010.09.005

Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.”10.1016/j.tcs.2012.10.056__SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–49, doi:10.1016/j.tcs.2012.10.056.
LibreCat: /record/16451
DOI: 10.1016/j.tcs.2012.10.056

Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.”10.1145/1989493.1989515__Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989515.
LibreCat: /record/16453
DOI: 10.1145/1989493.1989515

Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.”10.1145/1989493.1989517__Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989517.
LibreCat: /record/16454
DOI: 10.1145/1989493.1989517

Degener, Bastian, et al. “Building Simple Formations in Large Societies of Tiny Mobile Robots.”10.1016/j.procs.2011.09.049__Procedia Computer Science, 2011, pp. 153–55, doi:10.1016/j.procs.2011.09.049.
LibreCat: /record/16455
DOI: 10.1016/j.procs.2011.09.049

Degener, Bastian, et al. “Energy-Awareness in Self-Organising Robotic Exploration Teams.”10.1007/978-3-0348-0130-0_35__Organic Computing — A Paradigm Shift for Complex Systems, 2011, doi:10.1007/978-3-0348-0130-0_35.
LibreCat: /record/16456
DOI: 10.1007/978-3-0348-0130-0_35

Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.”10.1007/978-3-642-22212-2_13__Structural Information and Communication Complexity, 2011, doi:10.1007/978-3-642-22212-2_13.
LibreCat: /record/16459
DOI: 10.1007/978-3-642-22212-2_13

Hsu, D. Frank, et al. “EDITORIAL.”10.1142/s0219265911002885__Journal of Interconnection Networks, 2011, pp. vii–viii, doi:10.1142/s0219265911002885.
LibreCat: /record/17009
DOI: 10.1142/s0219265911002885

Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.”10.1007/978-3-642-22012-8_52__Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
LibreCat: /record/16409
DOI: 10.1007/978-3-642-22012-8_52

Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.”10.1007/978-3-642-18318-8_5__Workshop on Approximation and Online Algorithms (WAOA), vol. 6534, Springer, 2010, doi:10.1007/978-3-642-18318-8_5.
LibreCat: /record/19678
DOI: 10.1007/978-3-642-18318-8_5

Degener, Bastian, et al. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .”10.1109/IPDPS.2010.5470349__International Parallel &; Distributed Processing Symposium (IPDPS), 2010, doi:10.1109/IPDPS.2010.5470349.
LibreCat: /record/19711
DOI: 10.1109/IPDPS.2010.5470349

Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.”10.1007/978-3-642-05118-0_43__Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 5873, 2010, pp. 624--639, doi:10.1007/978-3-642-05118-0_43.
LibreCat: /record/19796
DOI: 10.1007/978-3-642-05118-0_43

Janson, Thomas, et al. “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs.”10.1109/icpads.2010.42__Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010, doi:10.1109/icpads.2010.42.
LibreCat: /record/19824
DOI: 10.1109/icpads.2010.42