Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
792 Publications
2011 | Dissertation | LibreCat-ID: 18976
Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Vol. 298. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
LibreCat
| Files available
2011 | Conference Paper | LibreCat-ID: 19026
Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011. https://doi.org/10.1145/1989493.1989518.
LibreCat
| DOI
2011 | Dissertation | LibreCat-ID: 19040
Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. Universität Paderborn, 2011.
LibreCat
| Files available
2011 | Journal Article | LibreCat-ID: 23739
Briest, Patrick, Piotr Krysta, and Berthold Vöcking. “Approximation Techniques for Utilitarian Mechanism Design.” SIAM Journal on Computing, 2011, 1587–1622. https://doi.org/10.1137/090772988.
LibreCat
| DOI
2011 | Journal Article | LibreCat-ID: 23740
Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, 1554–86. https://doi.org/10.1137/090752353.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20709
Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-18381-2_15.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20710
Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 18193
Renken, Hendrik, Christoph Laroque, and Matthias Fischer. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” In Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.
LibreCat
2011 | Preprint | LibreCat-ID: 18194
Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.
LibreCat
| Files available
2011 | Conference Paper | LibreCat-ID: 18568
Vöcking, Berthold, Martin Hoefer, Alexander Skopalik, Michal Penn, and Maria Polukarov. “Considerate Equilibrium.” In {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 234--239, 2011.
LibreCat
| Files available
2011 | Conference Paper | LibreCat-ID: 657
Abshoff, Sebastan, Andreas Cord-Landwehr, Bastian Degener, Barbara Kempkes, and Peter 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), 13–27. LNCS, 2011. https://doi.org/10.1007/978-3-642-28209-6_3.
LibreCat
| Files available
| DOI
2011 | Mastersthesis | LibreCat-ID: 663
Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011.
LibreCat
2011 | Conference Paper | LibreCat-ID: 664
Gehweiler, Joachim, Peter Kling, and Friedhelm 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), 31--40. LNCS, 2011. https://doi.org/10.1007/978-3-642-31500-8_4.
LibreCat
| Files available
| DOI
2011 | Conference (Editor) | LibreCat-ID: 667
Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, eds. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011. https://doi.org/10.1145/1989493.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 16410
Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, 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), 178–89. Springer, 2011. https://doi.org/10.1007/978-3-642-18381-2_15.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 16412
Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” In Algorithms Unplugged, 367–74. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-15328-0_38.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 16428
Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. “Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11,” 2011. https://doi.org/10.1145/1989493.
LibreCat
| DOI
2011 | Journal Article | LibreCat-ID: 16447
Degener, Bastian, Sándor P. Fekete, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” Computer Science Review, 2011, 57–68. https://doi.org/10.1016/j.cosrev.2010.09.005.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 16451
Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm 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, 138–49, 2011. https://doi.org/10.1016/j.tcs.2012.10.056.
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 16453
Degener, Bastian, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, and Roger 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. https://doi.org/10.1145/1989493.1989515.
LibreCat
| DOI