Ziegler, M. (2007). Revising Type-2 Computation and Degrees of Discontinuity. Electronic Notes in Theoretical Computer Science, 255–274.https://doi.org/10.1016/j.entcs.2006.08.015 

Ziegler, M. (2007). Real Hypercomputation and Continuity. Theory of Computing Systems, 177–206.https://doi.org/10.1007/s00224-006-1343-6 

Ziegler, M. (2007). (Short) Survey of Real Hypercomputation. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-73001-9_86 

Meer, K., &; Ziegler, M. (2007). Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-74456-6_64 

Lürwer-Brüggemeier, K., &; Ziegler, M. (2007). On Faster Integer Calculations using Non-Arithmetic Primitives. ArXiv:0709.0624.

Ziegler, M. (2007). Real Computability and Hypercomputation.

Fischer, M., Laroque, C., Huber, D., Krokowski, J., Mueck, B., Kortenjan, M.,   Dangelmaier, W. (2007). Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In European Simulation and Modelling Conference (ESM 2007) (pp. 499--505).

Dangelmaier, W.,  Laroque, C., &; Fischer, M. (2007). Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. Augmented &; Virtual Reality in Der Produktentstehung, 209, 95–110.

Buriol, L. S., Frahling, G., Leonardi, S., &; Sohler, C. (2007). Estimating Clustering Indexes in Data Streams. In Proceedings of the 15th European Symposium on Algorithms (ESA) (Vol. 4698, pp. 618–632). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-75520-3_55 

Sohler, C., &; Czumaj, A. (2007). On Testable Properties in Bounded Degree Graphs. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07) (pp. 494–501).

Sohler, C., &; Lammersen, C. (2007). StrSort Algorithms for Geometric Problems. In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG) (pp. 69–72).

Sohler, C., &; Czumaj, A. (2007). Testing Expansion in Bounded-Degree Graphs. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 570–578).

Sohler, C., &; Czumaj, A. (2007). Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07) (pp. 536–548).

Sohler, C., &; Czumaj, A. (2007). Sublinear-time approximation algorithms for clustering via random sampling. Random Structures &; Algorithms, 30(1–2), 226-- 256.

Sohler, C., Monemizahdeh, M., &; Feldman, D. (2007). A PTAS for k-means clustering based on weak coresets. In Proceedings of the 23rd annual symposium on computational geometry (SoCG’07) (pp. 11–18).

Sohler, C., Czumaj, A., &; Frahling, G. (2007). Efficient kinetic data structures for MaxCut. In Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG) (pp. 157–160).

Brinkmann, A., Effert, S., Meyer auf der Heide, F., &; Scheideler, C. (2007). Dynamic and redundant data placement. IEEE International Conference on Distributed Computing Systems (ICDCS).

Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H.,  Wachsmuth, H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment (pp. 215–222). Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn.

Dynia, M., Kutylowski, J., Meyer auf der Heide, F., &; Schrieb, J. (2007). Local strategies for maintaining a chain of relay stations between an explorer and a base station. In Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07.https://doi.org/10.1145/1248377.1248420 

Klein, J. (2006). Efficient Collision Detection for Point and Polygon Based Models (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Rührup, S. (2006). Position-based Routing Strategies (Vol. 203). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Briest, P., &; Krysta, P. (2006). Single-Minded Unlimited Supply Pricing on Sparse Instances. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA).

Briest, P., &; Gunia, C. (2006). Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC).

Degener, B. (2006). Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen.

Mahlmann, P., &; Schindelhauer, C. (2006). Distributed random digraph transformations for peer-to-peer networks. In Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06 (pp. 308--317).https://doi.org/10.1145/1148109.1148162 

Rührup, S., &; Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006).https://doi.org/10.1007/11940128_65 

Schindelhauer, C., &; Schomaker, G. (2006). SAN Optimal Multi Parameter Access Scheme. 5th International Conference on Networking (ICN).https://doi.org/10.1109/icniconsmcl.2006.190 

Rührup, S., &; Schindelhauer, C. (2006). Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn.

Schomaker, G., Loeser, C., &; Schubert, M. (2006). Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In 5th International Conference on Networking (ICN).

Brinkmann, A., Effert, S., Heidebuer, M., &; Vodisek, M. (2006). Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. 5th International Conference on Networking (ICN).https://doi.org/10.1109/icniconsmcl.2006.182 

Kortenjan, M., &; Schomaker, G. (2006). Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006).https://doi.org/10.1145/1108590.1108608 

Kutyowski, J., &; Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. SOFSEM 2006: Theory and Practice of Computer Science.https://doi.org/10.1007/11611257_37 

Brinkmann, A., Effert, S., Heidebuer, M., &; Vodisek, M. (2006). Influence of adaptive data layouts on performance in dynamically changing storage environments. 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06).https://doi.org/10.1109/pdp.2006.44 

Rammig, F.-J., Dangelmaier, W., Karl, H., Mertsching, B., Meyer auf der Heide, F., &; Trächtler, A. (Eds.). (2006). Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz Nixdorf Instituts.

Monien, B., &; Meyer auf der Heide, F. (2006). New trends in parallel and distributed computing (Vol. 181). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Grünewald, M., Meyer auf der Heide, F., Rührup, S., Schindelhauer, C., &; Volbert, K. (2006). Directional Communication in Mobile Ad Hoc Networks. New Trends in Parallel &; Distributed Computing, 6th Int. Heinz Nixdorf Symposium, 225–234.

Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &; Buriol, L. (2006). Computing Clustering Coefficients in Data Streams. In Proceedings of  the European Conference on Complex Systems (ECCS’06).

Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &; Buriol, L. (2006). Counting Triangles in Data Streams. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.).

Sohler, C., Gehweiler, J., &; Lammersen, C. (2006). A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).

Dynia, M., Korzeniowski, M., &; Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In Architecture of Computing Systems - ARCS (pp. 341--351).https://doi.org/10.1007/11682127_24 

Damerow, V. (2006). Average and Smoothed Complexity of Geometric Structures (Vol. 190). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Bonorden, O., Meyer auf der Heide, F., &; Gehweiler, J. (2006). A Web Computing Environment for Parallel Algorithms in Java. In Journal on Scalable Computing: Practice and Experience (pp. 1–14).

Gehweiler, J., &; Schomaker, G. (2006). Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. In Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT) (pp. 51–58).https://doi.org/10.1109/ds-rt.2006.15 

Faigle, U., &; Frahling, G. (2006). A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Applied Mathematics, 1380–1391.https://doi.org/10.1016/j.dam.2005.05.037 

Frahling, G., &; Sohler, C. (2006). A fast k-means implementation using coresets. In Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06.https://doi.org/10.1145/1137856.1137879 

Hamann, H. (2006). Modeling and Investigation of Robot Swarms.

Schindelhauer, C., Volbert, K., &; Ziegler, M. (2006). Geometric spanners with applications in wireless networks. Computational Geometry, 197–214.https://doi.org/10.1016/j.comgeo.2006.02.001 

Ziegler, M. (2006). Effectively open real functions. Journal of Complexity, 827–849.https://doi.org/10.1016/j.jco.2006.05.002 

Meer, K., &; Ziegler, M. (2006). Uncomputability Below the Real Halting Problem. In Logical Approaches to Computational Barriers. Berlin, Heidelberg.https://doi.org/10.1007/11780342_39 

Dangelmaier, W., Huber, D., Laroque, C., Aufenanger, M., Fischer, M., Krokowski, J., &; Kortenjan, M. (2006). d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations. In Simulation and Visualization 2006 (SimViS) (pp. 79–88). SCS European Publishing House.