Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.”10.1007/11561354_23__Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005), 2005, pp. 271–84, doi:10.1007/11561354_23.

Schindelhauer, Christian, et al. “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search.” European Conference on Complex Systems (ECCS 2005), 2005.

Brinkmann, André, et al. “Distributed MD.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88.

Brinkmann, André, et al. “An Integrated Architecture for Business Intelligence Support from Application down to Storage.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8.

Klein, Jan, and Gabriel Zachmann. “The Expected Running Time of Hierarchical Collision Detection.”10.1145/1186954.1187087__ACM SIGGRAPH 2005 Posters on 10.1145/1186954.1187087__- SIGGRAPH ’05, 2005, doi:10.1145/1186954.1187087.

Klein, Jan, and Gabriel Zachmann. “Interpolation Search for Point Cloud Intersection.”10.1145/1186223.1186329__Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–70, doi:10.1145/1186223.1186329.

Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts.”10.1007/978-3-540-31957-3_90__Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi:10.1007/978-3-540-31957-3_90.

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

Schindelhauer, Christian, and Gunnar Schomaker. “Weighted Distributed Hash Tables.”10.1145/1073970.1074008__SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, 2005, doi:10.1145/1073970.1074008.

Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.”10.1007/11561071_5__Algorithms – ESA 2005, 2005, doi:10.1007/11561071_5.

Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.

Dangelmaier, Wilhelm, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.”10.1016/j.compind.2005.01.007__Computers in Industry, 2005, pp. 371–83, doi:10.1016/j.compind.2005.01.007.

Fischer, Matthias, et al. “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations.”10.1109/wsc.2005.1574470__Proceedings of the Winter Simulation Conference, 2005, doi:10.1109/wsc.2005.1574470.

Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.”10.1137/s009753970444199x__SIAM Journal on Computing, vol. 34, no. 3, 2005, pp. 580–615, doi:10.1137/s009753970444199x.

Bdoiu, Mihai, et al. “Facility Location in Sublinear Time.”10.1007/11523468_70__Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–77, doi:10.1007/11523468_70.

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

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.”10.1016/j.tcs.2004.09.031__Theoretical Computer Science, vol. 331, no. 1, 2005, pp. 37–52, doi:10.1016/j.tcs.2004.09.031.

Czumaj, Artur, et al. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.”10.1137/s0097539703435297__SIAM Journal on Computing, vol. 35, no. 1, 2005, pp. 91–109, doi:10.1137/s0097539703435297.

Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.”10.1007/11561071_67__Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67.

Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.”10.1007/11549468_105__Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi:10.1007/11549468_105.

Bienkowski, Marcin, and Jarosaw Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.”10.1007/11561071_72__Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer , 2005, pp. 815–26, doi:10.1007/11561071_72.

Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–78.

Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.”10.1007/978-3-540-31956-6_49__Proceedings of the 4th International Conference on Networking, vol. 3420, Springer, 2005, pp. 413–20, doi:10.1007/978-3-540-31956-6_49.

Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.”10.1007/978-3-540-31856-9_30__Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30.

Räcke, Harald. Data Management and Routing in General Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.

Frahling, Gereon, et al. “Sampling in Dynamic Data Streams and Applications.”10.1145/1064092.1064116__Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005, doi:10.1145/1064092.1064116.

Köhler, Sven, et al. “On Approximating Real-World Halting Problems.”10.1007/11537311_40__Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_40.

Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.”10.1007/11537311_41__Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_41.

Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.”10.1007/11494645_68__Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.

Ziegler, Martin. “Computational Power of Infinite Quantum Parallelism.”10.1007/s10773-005-8984-0__International Journal of Theoretical Physics, vol. 44, no. 11, 2005, pp. 2059–71, doi:10.1007/s10773-005-8984-0.

Dangelmaier, Wilhelm, et al. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–70.

Loeser, Christoph, et al. “Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” IEEE International Conference on Industrial Informatics (INDIN), 2005.

Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005.

Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.”10.1007/11558989_20__Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.

Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.”10.1007/11549345_1__Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.

Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.”10.1007/11752578_96__Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96.

Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.”10.1007/11752578_101__Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–46, doi:10.1007/11752578_101.

Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.

Leonardi, Stefano, et al., editors. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol. 05361, 2005.

Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”10.1016/j.tcs.2005.09.053__Theoretical Computer Science, 2005, pp. 14–26, doi:10.1016/j.tcs.2005.09.053.

Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.

Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.”10.1007/978-3-540-30217-9_4__Parallel Problem Solving from Nature - PPSN VIII, 2004, doi:10.1007/978-3-540-30217-9_4.

Schweer, Andrea, et al. “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.” Parallel Problem Solving from Nature - PPSN VIII, 2004.

Brinkmann, André, et al. “A Case for Virtualized Arrays of RAID.”10.1145/1162628.1162630__Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 2004, pp. 9–16, doi:10.1145/1162628.1162630.

Schindelhauer, Christian, et al. “The Design of PaMaNet the Paderborn Mobile Ad-Hoc Network.”10.1145/1023783.1023807__Proceedings of the Second International Workshop on Mobility Management &; Wireless Access Protocols, 2004, doi:10.1145/1023783.1023807.

Bleckmann, Peter, et al. “Virtualization with Prefetching Abilities Based on ISCSI.”10.1145/1162628.1162634__Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, no. 2, 2004, pp. 40–47, doi:10.1145/1162628.1162634.

Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity Graphs.”10.1016/j.cag.2004.08.012__Computers and Graphics, vol. 28, no. 6, 2004, pp. 839–50, doi:10.1016/j.cag.2004.08.012.

Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over Point Clouds.” Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004, pp. 131–38.

Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy Point Clouds.” SIGGRAPH 2004, Sketches, 2004.

Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–76.