A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down &; Sleep for Profit in Online Deadline Scheduling,” in Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231.
LibreCat: /record/580
DOI: 10.1007/978-3-642-34862-4_17

M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.
LibreCat: /record/581
DOI: 10.1109/IPDPS.2012.116

B. Kempkes, Local strategies for robot formation problems, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.
LibreCat: /record/601

P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.
LibreCat: /record/619
DOI: 10.1145/2414815.2414818

A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.
LibreCat: /record/628
DOI: 10.1007/978-3-642-33996-7_7

F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility Leasing,” in Proceedings of the 19th International Colloquium on Structural Information &; Communication Complexity (SIROCCO), 2012, pp. 61–72.
LibreCat: /record/636
DOI: 10.1007/978-3-642-31104-8_6

F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken. Universität Paderborn, 2012.
LibreCat: /record/638

B. Kempkes and F. Meyer auf der Heide, “Continuous Local Strategies for Robotic Formation Problems,” in Experimental Algorithms, Berlin, Heidelberg, 2012.
LibreCat: /record/16445
DOI: 10.1007/978-3-642-30850-5_2

B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Optimal and competitive runtime bounds for continuous, local gathering of mobile robots,” in Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12, 2012.
LibreCat: /record/16446
DOI: 10.1145/2312005.2312009

B. Kempkes and F. Meyer auf der Heide, “Local, Self-organizing Strategies for Robotic Formation Problems,” in Algorithms for Sensor Systems, Berlin, Heidelberg, 2012.
LibreCat: /record/16448
DOI: 10.1007/978-3-642-28209-6_2

T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,”10.1007/978-3-642-33179-4_48__in Advances in Visual Computing, 2012, vol. 7431, pp. 502–512, doi:10.1007/978-3-642-33179-4_48 .
LibreCat: /record/16408
DOI: 10.1007/978-3-642-33179-4_48

M. Korzeniowski, Dynamic Load Balancing in Peer-to-Peer Networks, vol. 289. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
LibreCat: /record/19619

P. Briest, P. Krysta, and M. Hoefer, “Stackelberg Network Pricing Games,” Algorithmica, vol. 62, pp. 733–753, 2011.
LibreCat: /record/19677
DOI: 10.1007/s00453-010-9480-3

C. Jähn, R. Petring, and B. Eikel, “PADrend: Platform for Algorithm Development and Rendering,” in Augmented &; Virtual Reality in der Produktentstehung, 2011, vol. 295, pp. 159--170.
LibreCat: /record/19845

H. Hamann, T. Schmickl, K. Crailsheim, N. Krasnogor, and P. Luca Lanzi, “Coupled inverted pendulums: A benchmark for evolving decentral controllers in modular robotics,” in Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011, 2011, pp. 195--202.
LibreCat: /record/20180
DOI: 10.1145/2001576.2001604

H. Hamann, T. Schmickl, and K. Crailsheim, “Thermodynamics of Emergence: Langton’s Ant Meets Boltzmann,” in IEEE Symposium on Artificial Life (IEEE ALIFE 2011), 2011, pp. 62--69.
LibreCat: /record/20181
DOI: 10.1109/ALIFE.2011.5954660

H. Hamann, T. Schmickl, and K. Crailsheim, “Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System,” in 10th European Conference on Artificial Life (ECAL’09), 2011, vol. 5777, pp. 442--449.
LibreCat: /record/20183
DOI: 10.1007/978-3-642-21283-3_55

H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, and R. Fitch, “Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers,” in Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples, 2011.
LibreCat: /record/20184

H. Hamann and T. Schmickl, “BEECLUST: A Swarm Algorithm Derived from Honeybees,” in Bio-inspired Computing and Communication Networks, Y. Xiao, Ed. Boca Raton, FL, USA: CRC Press, 2011.
LibreCat: /record/20193

H. Hamann et al., “Evolving a novel bio-inspired controller in reconfigurable robots,” in Advances in Artificial Life, 10th European Conference, ECAL 2009, 2011, pp. 132--139.
LibreCat: /record/20194

H. Hamann, T. Schmickl, K. Crailsheim, R. Thenius, and D. Kengyel, “Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm,” in 10th European Conference on Artificial Life (ECAL’09), 2011.
LibreCat: /record/20195
DOI: 10.1007/978-3-642-21314-4_9

H. Hamann, T. Schmickl, and K. Crailsheim, “Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem,” in Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems, T. Lenaerts, M. Giacobini, H. Bersini, P. Bourgine, M. Dorigo, and R. Doursat, Eds. MIT Press, 2011, pp. 302--309.
LibreCat: /record/20196

H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, and L. Winkler, “Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics,” in New Horizons in Evolutionary Robotics, Berlin, Heidelberg: Springer, 2011.
LibreCat: /record/20214
DOI: 10.1007/978-3-642-18272-3_13

T. Schmickl, H. Hamann, and K. Crailsheim, “Modelling a hormone-inspired controller for individual- and multi-modular robotic systems,” Mathematical and Computer Modelling of Dynamical Systems, vol. 17, no. 3, pp. 221–242, 2011.
LibreCat: /record/20215
DOI: 10.1080/13873954.2011.557862

T. Suess, C. Koch, C. Jähn, and M. Fischer, “Approximative occlusion culling using the hull tree,” in Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, 2011, pp. 79--86.
LibreCat: /record/17420

A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge based routing for AGVs in a distribution warehouse,” in Proceedings of the 2011 Winter Simulation Conference (WSC), 2011.
LibreCat: /record/17421
DOI: 10.1109/wsc.2011.6147883

T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze,” in Augmented &; Virtual Reality in der Produktentstehung, 2011, vol. 295, pp. 185--197.
LibreCat: /record/17450

T. Suess, Parallel Real-Time Rendering using Heterogeneous PC Clusters. Universität Paderborn, 2011.
LibreCat: /record/17454

G. Frahling, Algorithms for Dynamic Geometric Data Streams, vol. 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
LibreCat: /record/18973

J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
LibreCat: /record/18974

J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
LibreCat: /record/18976

P. Briest and C. Raupach, “The car sharing problem,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.
LibreCat: /record/19026
DOI: 10.1145/1989493.1989518

S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn, 2011.
LibreCat: /record/19040

P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.
LibreCat: /record/23739
DOI: 10.1137/090772988

P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011.
LibreCat: /record/23740
DOI: 10.1137/090752353

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.
LibreCat: /record/20709
DOI: 10.1007/978-3-642-18381-2_15

A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.
LibreCat: /record/20710
DOI: 10.1007/978-3-642-22012-8_52

H. Renken, C. Laroque, and M. 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: /record/18193

T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel Out-of-Core Occlusion Culling.” 2011.
LibreCat: /record/18194

B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, and M. Polukarov, “Considerate Equilibrium,” in IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.
LibreCat: /record/18568

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

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

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

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

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Awareness in Self-organising Robotic Exploration Teams,” in Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.
LibreCat: /record/16456
DOI: 10.1007/978-3-0348-0130-0_35

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.
LibreCat: /record/16459
DOI: 10.1007/978-3-642-22212-2_13

D. F. Hsu, B. M. Magga, H. C. T. Ho, J. Hromkovic, F. C. M. Lau, and F. Meyer auf der Heide, “EDITORIAL,” Journal of Interconnection Networks, pp. vii–viii, 2011.
LibreCat: /record/17009
DOI: 10.1142/s0219265911002885

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

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

B. Degener, P. Pietrzyk, and B. Kempkes, “A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ,” in International Parallel &; Distributed Processing Symposium (IPDPS), 2010.
LibreCat: /record/19711
DOI: 10.1109/IPDPS.2010.5470349

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

T. Janson, P. Mahlmann, and C. Schindelhauer, “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs,” in Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010.
LibreCat: /record/19824
DOI: 10.1109/icpads.2010.42

H. Miao, C. C. Ooi, X. Wu, and C. Schindelhauer, “Coverage-hole trap model in target tracking using distributed relay-robot network,” in Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10, 2010, pp. 1299–1304.
LibreCat: /record/19829
DOI: 10.1145/1774088.1774365

G. Schomaker, S. Oberthur, and M. Kortenjan, “Distributed and dynamic resource management for self-optimizing mechatronic systems,” in 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010.
LibreCat: /record/19933
DOI: 10.1109/indin.2010.5549647

H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer, 2010.
LibreCat: /record/20182
DOI: 10.1007/978-3-642-13377-0

H. Hamann, T. Schmickl, J. Stradner, and K. Crailsheim, “A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251.
LibreCat: /record/20220
DOI: 10.1109/CEC.2010.5585994

T. Schmickl, H. Hamann, J. Stradner, R. Mayet, and K. Crailsheim, “Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller,” in Proc. of the ALife XII Conference, 2010, pp. 648--655.
LibreCat: /record/20222

H. Hamann, J. Stradner, T. Schmickl, and K. Crailsheim, “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics,” in Artificial Life XII (ALife XII), Odense, Denmark, 2010, pp. 773–780.
LibreCat: /record/20223
arXiv: 1011.3912

H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in From Animals to Animats 11, 2010, vol. 6226, pp. 639–648.
LibreCat: /record/20226
DOI: 10.1007/978-3-642-15193-4_60

S. Kernbach et al., “On Adaptive Self-Organization in Artificial Robot Organisms,” in 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2010.
LibreCat: /record/20258
DOI: 10.1109/computationworld.2009.9

R. Grzablewicz, J. Kutyowski, M. Kutyowski, and W. Pietkiewicz, “Robust Undetectable Interference Watermarks,”10.1007/11424826_55__ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications, 2010, doi:10.1007/11424826_55 .
LibreCat: /record/24282
DOI: 10.1007/11424826_55

S. Samara and G. Schomaker, “Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip,”10.1109/cit.2010.304__2010, doi:10.1109/cit.2010.304 .
LibreCat: /record/27159
DOI: 10.1109/cit.2010.304

M. Fischer, H. Renken, C. Laroque, G. Schaumann, and W. Dangelmaier, “Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations,” in Proceedings of the 2010 Winter Simulation Conference, 2010.
LibreCat: /record/17422
DOI: 10.1109/wsc.2010.5678906

J. Gehweiler, F. Meyer auf der Heide, and U.-P. Schroeder, A Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf Institut, 2010.
LibreCat: /record/17462

M. J. Blesa et al., Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study. 2010.
LibreCat: /record/17464

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building short chains of mobile robots locally with a bounded stepwidth.” 2010.
LibreCat: /record/17586

R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” in DIALM-PODC, 2010, pp. 33–42.
LibreCat: /record/17665

H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, and S. Kernbach, “Hormone-based Control for Multi-modular Robotics,” in Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 240--263.
LibreCat: /record/18761

M. Bienkowski, Page migration in dynamic networks, vol. 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/18910

M. Dynia, Collective graph exploration, vol. 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/18927

B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” Algorithmica, vol. 57, no. 3, pp. 562–584, 2010.
LibreCat: /record/19011
DOI: 10.1007/s00453-008-9250-7

J. Gehweiler and H. Meyerhenke, “A distributed diffusive heuristic for clustering a virtual P supercomputer,” in Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010.
LibreCat: /record/19013
DOI: 10.1109/ipdpsw.2010.5470922

J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph Clustering using Diffusion,” in Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.
LibreCat: /record/19016

M. Thies and J. Gehweiler, Thread Migration and Checkpointing in Java. 2010.
LibreCat: /record/19018

S. Kernbach et al., “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics,” in Artificial Life XII (ALife XII), 2010, pp. 781–788.
LibreCat: /record/19023

P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop on Internet and Network Economics (WINE), 2010.
LibreCat: /record/19029
DOI: 10.1007/978-3-642-17572-5_37

F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.
LibreCat: /record/1903
DOI: 10.1007/s00287-010-0470-2

P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized Allocations,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.
LibreCat: /record/19033
DOI: 10.1137/1.9781611973075.49

P. Mahlmann, Peer-to-peer networks based on random graphs, vol. 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/19041

B. Degener, Local, distributed approximation algorithms for geometric assignment problems, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/19042

M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation,”10.2312/EGPGV/EGPGV10/043-051__in Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), 2010, pp. 43–51, doi:10.2312/EGPGV/EGPGV10/043-051 .
LibreCat: /record/18136
DOI: 10.2312/EGPGV/EGPGV10/043-051

T. Suess, T. Wiesemann, and M. Fischer, “Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments,”10.1109/nas.2010.52__in 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 2010, pp. 448–456, doi:10.1109/nas.2010.52 .
LibreCat: /record/18289
DOI: 10.1109/nas.2010.52

T. Suess, T. Wiesemann, and M. Fischer, “Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems,” in Augmented &; Virtual Reality in der Produktentstehung, 2010, pp. 39–52.
LibreCat: /record/18290

F. Meyer auf der Heide and C. A. Phillips, “Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10,” 2010.
LibreCat: /record/16414
DOI: 10.1145/1810479

B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in Advances in Visual Computing, Berlin, Heidelberg, 2010.
LibreCat: /record/16505
DOI: 10.1007/978-3-642-17289-2_60

B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.
LibreCat: /record/16365
DOI: 10.1007/978-3-642-13284-1_14

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering algorithm,” in Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10, 2010.
LibreCat: /record/16401
DOI: 10.1145/1810479.1810523

S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg, 2010.
LibreCat: /record/16403
DOI: 10.1007/978-3-642-14162-1

S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg, 2010.
LibreCat: /record/16404
DOI: 10.1007/978-3-642-14165-2

K. Lürwer-Brüggemeier, Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division, vol. 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19605

M. Mense, On Fault-Tolerant Data Placement in Storage Networks, vol. 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19614

M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19617