Suess, Tim, et al. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” Augmented &; Virtual Reality in Der Produktentstehung, 2010, pp. 39–52.

Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10. 2010, doi:10.1145/1810479.

Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.”10.1007/978-3-642-17289-2_60__Advances in Visual Computing, 2010, doi:10.1007/978-3-642-17289-2_60.

Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.”10.1007/978-3-642-13284-1_14__Structural Information and Communication Complexity, 2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.

Degener, Bastian, et al. “A Local O(N2) Gathering Algorithm.”10.1145/1810479.1810523__Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010, doi:10.1145/1810479.1810523.

Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.

Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.

Lürwer-Brüggemeier, Katharina. Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.

Mense, Mario. On Fault-Tolerant Data Placement in Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.

Kortenjan, Michael. Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.

Bonorden, Olaf. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.

Bonorden, Olaf, et al. Complexity and Approximation of a Geometric Local Robot Assignment Problem. 2009.

Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.”10.1007/978-3-642-05434-1_25__Algorithmic Aspects of Wireless Sensor Networks, Springer, 2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.

Schindelhauer, Christian, et al. 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany, 2009.

Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.”10.1007/s11036-008-0150-5__Mobile Networks and Applications (MONET), 2009, pp. 309–21, doi:10.1007/s11036-008-0150-5.

Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.”10.1007/s11235-009-9188-3__Telecommunication Systems, vol. 43, 2009, pp. 25–37, doi:10.1007/s11235-009-9188-3.

Raptopoulos, Christoforos L., et al. “Colouring Non-Sparse Random Intersection Graphs.”10.1007/978-1-4939-2864-4_597__34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611, doi:10.1007/978-1-4939-2864-4_597.

Nikoletseas, Sotiris E., et al. “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.”10.1109/IPDPS.2009.5161002__10.1109/IPDPS.2009.5161002__Proceedings of IPDPS - IEEE International Parallel &; Distributed Processing Symposium, 2009, pp. 1--11, doi:10.1109/IPDPS.2009.5161002.

Deveci, Deniz, et al. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.”  Parallel and Distributed Computing and Systems, Nr. 21, 2009.

Stradner, Jürgen, et al. “Analysis and Implementation of an Artificial Homeostatic Hormone System: A First Case Study in Robotic Hardware.”10.1109/iros.2009.5354056__2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009, doi:10.1109/iros.2009.5354056.

Schmickl, Thomas, et al. “Two Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.”10.1016/j.robot.2009.06.002__Robotics and Autonomous Systems, vol. 6, no. 9, 2009, pp. 913–21, doi:10.1016/j.robot.2009.06.002.

Hamann, Heiko, et al. “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.

Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” Public Service Review: Science and Technology, vol. 04, 2009.

Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).”10.1524/itit.2009.0524__It - Information Technology, vol. 51, no. 1, 2009, pp. 62–65, doi:10.1524/itit.2009.0524.

Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded Consumers.”10.1007/978-3-642-10841-9_6__Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.

Laroque, Christoph, et al. “Concepts for Model Verification and Validation during Simulation Runtime.” European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.

Suess, Tim, et al. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” Augmented &; Virtual Reality in Der Produktentstehung, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.

Fischer, Matthias, et al. “Planar Visibility Counting.” Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–06.

Kutyowski, Jarosaw, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.”10.1016/j.tcs.2008.04.010__Theoretical Computer Science, 2009, pp. 3391–405, doi:10.1016/j.tcs.2008.04.010.

Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.”10.1145/1583991.1584072__Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009, doi:10.1145/1583991.1584072.

Meyer auf der Heide, Friedhelm, and Michael A. Bender, editors. Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09. 2009, doi:10.1145/1583991.

Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic Networks.”10.1016/j.jda.2008.07.006__Journal of Discrete Algorithms, 2009, pp. 545–69, doi:10.1016/j.jda.2008.07.006.

Schomaker, Gunnar. Distributed Resource Allocation and Management in Heterogeneous Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.

Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.”10.1007/978-3-540-70575-8_66__Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008, doi:10.1007/978-3-540-70575-8_66.

Briest, Patrick, et al. “On the Approximability of Combinatorial Exchange Problems.”https://doi.org/10.1007/978-3-540-79309-0_9__Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), 2008, doi:https://doi.org/10.1007/978-3-540-79309-0_9.

Briest, Patrick, et al. Approximate Equilibria in Games with Few Players. 2008.

Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer Overlays.” The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, no. 222, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.

Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile Wireless Networks.”10.1007/978-0-387-84839-6_6__MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), Springer, 2008, doi:10.1007/978-0-387-84839-6_6.

Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots.”10.1007/978-3-642-00644-9_4__ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008, doi:10.1007/978-3-642-00644-9_4.

Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten. 2008.

Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems. 2008, doi:10.1007/978-3-642-13377-0.

Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the Reals.” ArXiv:0802.2027, 2008.

Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial Arithmetic.” Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–56.

Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied Mathematics and Computation, 2008.

Ziegler, Martin. “A Meta-Theory of Physics and Computation.” Verhandlungen Der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft (DPG), 2008, p. 145.

Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.”10.1016/j.jco.2006.09.004__Journal of Complexity, 2008, pp. 3–15, doi:10.1016/j.jco.2006.09.004.

Suess, Tim, et al. “A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations.”10.1109/ispa.2008.30__IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008, doi:10.1109/ispa.2008.30.

Meyer auf der Heide, Friedhelm. The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS). Vol. 222, Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.

Dangelmaier, Wilhelm, et al. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.”10.1109/wsc.2008.4736296__2008 Winter Simulation Conference, 2008, pp. 2012–20, doi:10.1109/wsc.2008.4736296.

Degener, Bastian, et al. “The Kinetic Facility Location Problem.”10.1007/978-3-540-69903-3_34__Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89, doi:10.1007/978-3-540-69903-3_34.

Gehweiler, Joachim, et al. “The Kinetic Facility Location Problem.” Proceedings of the 24th European Workshop on Computational Geometry, 2008, pp. 251–54.

Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.

Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.”10.1007/978-3-540-69134-1_44__The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), vol. 5040, 2008, pp. 447--456, doi:10.1007/978-3-540-69134-1_44.

Hamann, Heiko, et al. “Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm.”10.1109/IROS.2008.4651038__IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08), IEEE Press, 2008, pp. 1415--1420, doi:10.1109/IROS.2008.4651038.

Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models for Algorithm Design in Swarm Robotics.”10.1007/s11721-008-0015-3__Swarm Intelligence, vol. 2, no. 2–4, 2008, pp. 209–39, doi:10.1007/s11721-008-0015-3.

Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.”10.1007/978-3-540-85194-3_11__Unconventional Computing, 2008, doi:10.1007/978-3-540-85194-3_11.

Laroque, Christoph, et al. “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations.” Industrial Simulation Conference (ISC 2008), EUROSIS-ETI, 2008, pp. 306–10.

Laroque, Christoph, et al. “Regelung von Animationen in Simulationen von  Hochdynamischen Fabrikszenen .” Augmented &; Virtual Reality in Der Produktentstehung, vol. 232, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 193--206.

Le Roux, Stéphane, and Martin Ziegler. “Singular Coverings and Non-Uniform Notions of Closed Set Computability.”10.1016/j.entcs.2008.03.009__Electronic Notes in Theoretical Computer Science, 2008, pp. 73–88, doi:10.1016/j.entcs.2008.03.009.

Ackermann, Heiner, et al. “Who Should Pay for Forwarding Packets?”10.1007/978-3-540-77105-0_21__Internet Mathematics, vol. 5, no. 4, Springer, 2008, pp. 459–75, doi:10.1007/978-3-540-77105-0_21.

Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies for Connecting Stations by Small Robotic Networks.”10.1007/978-0-387-09655-1_9__Biologically-Inspired Collaborative Computing, 2008, doi:10.1007/978-0-387-09655-1_9.

Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder eWie Bekomme Ich Die Klamotten in Die Kisten?“.”10.1007/978-3-540-76394-9_40__Taschenbuch Der Algorithmen, 2008, doi:10.1007/978-3-540-76394-9_40.

Fischer, Matthias, et al. “Planar Visibility Counting.” ArXiv:0810.0052, 2008.

Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM, 2008, doi:10.1145/1378533.

Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness of Non-Parametric Multi-Product Pricing.” Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.

Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting Using Process Migrations.”10.1109/ipdps.2007.370330__2007 IEEE International Parallel and Distributed Processing Symposium, 2007, doi:10.1109/ipdps.2007.370330.

Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.”10.1007/s11036-008-0150-5__ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination, 2007, pp. 309–21, doi:10.1007/s11036-008-0150-5.

Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments.”10.1109/aina.2007.59__Advanced Information Networking and Applications (AINA-07), vol. 21, 2007, pp. 331–39, doi:10.1109/aina.2007.59.

Bienkowski, Marcin, and Jarosaw Kutyowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.”10.1007/978-3-540-73951-7_30__Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73951-7_30.

Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke. Springer, 2007, doi:10.1007/978-3-540-33992-2.

Leonardi, Stefano, et al. “Guarding Our Digital Society’s Well-Being.” E-Strategies, Www.Britishpublishers.Com, vol. 3-10–2007, 2007.

Dynia, Miroslaw, et al. “Why Robots Need Maps.”10.1007/978-3-540-72951-8_5__Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37-- 46, doi:10.1007/978-3-540-72951-8_5.

Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.”10.1007/978-3-540-69507-3_21__Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), vol. 4362, 2007, pp. 260--271, doi:10.1007/978-3-540-69507-3_21.

Kutylowski, Jaroslaw. Using Mobile Relays for Ensuring Connectivity in Sparse Networks. 2007.

Kutylowski, Jaroslaw. Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries. 2007.

Dorigo, Marco, et al. “Orientation in a Trail Network by Exploiting Its Geometry for Swarm Robotics.”10.1109/SIS.2007.367953__IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5, IEEE Press, 2007, pp. 310--315, doi:10.1109/SIS.2007.367953.

Hamann, Heiko, et al. “An Analytical and Spatial Model of Foraging in a Swarm of Robots.”10.1007/978-3-540-71541-2_4__Swarm Robotics - Second SAB 2006 International Workshop, vol. 4433, 2007, pp. 43--55, doi:10.1007/978-3-540-71541-2_4.

Hamann, Heiko, and Heinz Wörn. “A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support.”10.1109/saso.2007.3__First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31, doi:10.1109/saso.2007.3.

Hamann, Heiko, et al. “Embodied Computation.” Parallel Processing Letters, vol. 17, no. 3, 2007, pp. 287--298.

Hamann, Heiko, et al. “From Micro to Nano and Swarm Robotics.”10.1142/9789812770189_0003__Advances in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18, 2007, pp. 15--24, doi:10.1142/9789812770189_0003.

Ziegler, Martin. “Revising Type-2 Computation and Degrees of Discontinuity.”10.1016/j.entcs.2006.08.015__Electronic Notes in Theoretical Computer Science, 2007, pp. 255–74, doi:10.1016/j.entcs.2006.08.015.

Ziegler, Martin. “Real Hypercomputation and Continuity.”10.1007/s00224-006-1343-6__Theory of Computing Systems, 2007, pp. 177–206, doi:10.1007/s00224-006-1343-6.

Ziegler, Martin. “(Short) Survey of Real Hypercomputation.”10.1007/978-3-540-73001-9_86__Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73001-9_86.

Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.”10.1007/978-3-540-74456-6_64__Mathematical Foundations of Computer Science 2007, 2007, doi:10.1007/978-3-540-74456-6_64.

Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” ArXiv:0709.0624, 2007.

Ziegler, Martin. Real Computability and Hypercomputation. 2007.

Fischer, Matthias, et al. “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in One 3D Environment.” European Simulation and Modelling Conference (ESM 2007), 2007, pp. 499--505.

Dangelmaier, Wilhelm, et al. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.” Augmented &; Virtual Reality in Der Produktentstehung, vol. 209, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007, pp. 95–110.

Buriol, Luciana S., et al. “Estimating Clustering Indexes in Data Streams.”10.1007/978-3-540-75520-3_55__Proceedings of the 15th European Symposium on Algorithms (ESA), vol. 4698, Springer, 2007, pp. 618–32, doi:10.1007/978-3-540-75520-3_55.

Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree Graphs.” Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07), 2007, pp. 494–501.

Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric Problems.” Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), 2007, pp. 69–72.

Sohler, Christian, and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.” Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 570–78.

Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric Min-Sum k-Clustering and Their Applications.” Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–48.

Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms for Clustering via Random Sampling.” Random Structures &; Algorithms, vol. 30, no. 1–2, 2007, pp. 226-- 256.

Sohler, Christian, et al. “A PTAS for K-Means Clustering Based on Weak Coresets.” Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07), 2007, pp. 11–18.

Sohler, Christian, et al. “Efficient Kinetic Data Structures for MaxCut.” Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp. 157–60.

Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.

Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of Paderborn, 2007, pp. 215–22.

Dynia, Miroslaw, et al. “Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station.”10.1145/1248377.1248420__Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07, 2007, doi:10.1145/1248377.1248420.

Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.