M. Kortenjan and G. Schomaker, “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), 2006.

J. Kutyowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,”10.1007/11611257_37__2006, doi:10.1007/11611257_37 .

A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Influence of adaptive data layouts on performance in dynamically changing storage environments,”10.1109/pdp.2006.44__2006, doi:10.1109/pdp.2006.44 .

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

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

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

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

C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Counting Triangles in Data Streams,” 2006.

C. Sohler, J. Gehweiler, and C. Lammersen, “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), 2006.

M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in Architecture of Computing Systems - ARCS, 2006, no. 3894, pp. 341--351.

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

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

J. Gehweiler and G. Schomaker, “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), 2006, pp. 51–58.

U. Faigle and G. Frahling, “A combinatorial algorithm for weighted stable sets in bipartite graphs,” Discrete Applied Mathematics, pp. 1380–1391, 2006.

G. Frahling and C. Sohler, “A fast k-means implementation using coresets,” in Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06, 2006.

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

C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications in wireless networks,” Computational Geometry, pp. 197–214, 2006.

M. Ziegler, “Effectively open real functions,” Journal of Complexity, pp. 827–849, 2006.

K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.

W. Dangelmaier et al., <sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations,” in Simulation and Visualization 2006 (SimViS), 2006, pp. 79–88.

C. Sohler and A. Czumaj, “Sublinear-time Algorithms,” EATCS Bulletin, no. 89, pp. 23--47, 2006.

O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, and B. Rehberg, “Efficient Parallel Algorithms,” in Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &; Distributed Computing, 2006, vol. 181, pp. 137–153.

E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Petrafcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space),” in LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.

M. Dynia, J. Kutyowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.

M. Dynia, J. Kutyowski, P. Lorek, and F. Meyer auf der Heide, “Maintaining Communication Between an Explorer and a Base Station,” in IFIP International Federation for Information Processing, Boston, MA, 2006.

M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer, SmartS Simulator Design. 2006.

K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, vol. 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.

P. Mahlmann and C. Schindelhauer, “Peer-to-peer networks based on random transformations of connected regular undirected graphs,” in Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05, 2005.

S. Rührup and C. Schindelhauer, “Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure,”10.1109/ipdps.2005.147__in 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi:10.1109/ipdps.2005.147 .

S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), 2005, vol. 3738, pp. 244–257.

C. Schindelhauer and K. Voß, “Probability Distributions for Channel Utilisation,” in Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005), 2005, pp. 271–284.

C. Schindelhauer, G. Weikum, D. Hales, and P. Triantafillou, “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search,” in European Conference on Complex Systems (ECCS 2005), 2005.

A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Distributed MD,” in In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88.

A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, and H. Baars, “An integrated Architecture for Business Intelligence support from Application down to Storage,” in In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8.

J. Klein and G. Zachmann, “The expected running time of hierarchical collision detection,” in ACM SIGGRAPH 2005 Posters on   - SIGGRAPH ’05, 2005.

J. Klein and G. Zachmann, “Interpolation Search for Point Cloud Intersection,” in Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–170.

C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, and M. Heidebuer, “Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3421, pp. 800–810.

M. Ziegler and B. Fuchssteiner, “Nonlinear Reformulation of Heisenberg’s Dynamics,”10.1007/s10773-005-7048-9__International Journal of Theoretical Physics, pp. 693–717, 2005, doi:10.1007/s10773-005-7048-9 .

C. Schindelhauer and G. Schomaker, “Weighted distributed hash tables,”10.1145/1073970.1074008__2005, doi:10.1145/1073970.1074008 .

S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in Algorithms – ESA 2005, Berlin, Heidelberg, 2005.

M. Fischer, Design, analysis, and evaluation of a data structure for distributed virtual environments, vol. 164. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.

W. Dangelmaier, M. Fischer, J. Gausemeier, M. Grafe, C. Matysczok, and B. Mueck, “Virtual and augmented reality support for discrete manufacturing system simulation,” Computers in Industry, pp. 371–383, 2005.

M. Fischer, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, and W. Dangelmaier, “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations,” in Proceedings of the Winter Simulation Conference, 2005.

A. Czumaj and C. Sohler, “Abstract Combinatorial Programs and Efficient Property Testers,” SIAM Journal on Computing, vol. 34, no. 3, pp. 580–615, 2005.

M. Bdoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–877.

C. Sohler and G. Frahling, “Coresets in Dynamic Geometric Data Streams,” in Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–217.

A. Czumaj and C. Sohler, “Testing hypergraph colorability,” Theoretical Computer Science, vol. 331, no. 1, pp. 37–52, 2005.

A. Czumaj et al., “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time,” SIAM Journal on Computing, vol. 35, no. 1, pp. 91–109, 2005.

G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769.

M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in Proc. of the European Conference in Parallel Processing (Euro-Par), 2005.