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

Dangelmaier, Wilhelm, Matthias Fischer, Jürgen Gausemeier, Michael Grafe, Carsten Matysczok, and Bengt Mueck. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.”https://doi.org/10.1016/j.compind.2005.01.007__Computers in Industry, 2005, 371–83.https://doi.org/10.1016/j.compind.2005.01.007 .

Fischer, Matthias, 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.”https://doi.org/10.1109/wsc.2005.1574470__In Proceedings of the Winter Simulation Conference, 2005.https://doi.org/10.1109/wsc.2005.1574470 .

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

Bdoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.”https://doi.org/10.1007/11523468_70__In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 866–77. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11523468_70 .

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

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

Czumaj, Artur, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, and Christian Sohler. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.”https://doi.org/10.1137/s0097539703435297__SIAM Journal on Computing 35, no. 1 (2005): 91–109.https://doi.org/10.1137/s0097539703435297 .

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

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

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

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

Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.”https://doi.org/10.1007/978-3-540-31956-6_49__In Proceedings of the 4th International Conference on Networking, 3420:413–20.https://doi.org/10.1007/978-3-540-31956-6_49__Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005.https://doi.org/10.1007/978-3-540-31956-6_49 .

Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.”https://doi.org/10.1007/978-3-540-31856-9_30__In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 365–76. Lecture Notes in Computer Science, 2005.https://doi.org/10.1007/978-3-540-31856-9_30 .

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

Frahling, Gereon, Piotr Indyk, and Christian Sohler. “Sampling in Dynamic Data Streams and Applications.”https://doi.org/10.1145/1064092.1064116__In Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005.https://doi.org/10.1145/1064092.1064116 .

Köhler, Sven, Christian Schindelhauer, and Martin Ziegler. “On Approximating Real-World Halting Problems.”https://doi.org/10.1007/11537311_40__In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11537311_40 .

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

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

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

Dangelmaier, Wilhelm, Bengt Mueck, Matthias Fischer, Kiran Mahajan, and Christoph  Laroque. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” In Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 267–70, 2005.

Loeser, Christoph, Isabell Drüke, and Brigitte Oesterdiekhoff. “Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” In IEEE International Conference on Industrial Informatics (INDIN), 2005.

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

Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.”https://doi.org/10.1007/11558989_20__In Peer-to-Peer Systems IV. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11558989_20 .

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

Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.”https://doi.org/10.1007/11752578_96__In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 801–8, 2005.https://doi.org/10.1007/11752578_96 .

Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.”https://doi.org/10.1007/11752578_101__In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 839–46, 2005.https://doi.org/10.1007/11752578_101 .

Bienkowski, Marcin, Valentina Damerow, Friedhelm Meyer auf der Heide, and Christian Sohler. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” In Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven, 2005.

Leonardi, Stefano, Friedhelm Meyer auf der Heide, and Dorothea Wagner, eds. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol. 05361. Dagstuhl Seminar Proceedings, 2005.

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

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

Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.”https://doi.org/10.1007/978-3-540-30217-9_4__In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30217-9_4 .

Schweer, Andrea, Michael Leifhelm, Bastian Degener, Oliver Heering, Stefan Tannenbaum, Heiko Röglin, Christian Gunia, et al. “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.” In Parallel Problem Solving from Nature - PPSN VIII, 2004.

Brinkmann, André, Kay Salzwedel, and Mario Vodisek. “A Case for Virtualized Arrays of RAID.”https://doi.org/10.1145/1162628.1162630__In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 9–16, 2004.https://doi.org/10.1145/1162628.1162630 .

Schindelhauer, Christian, Stefan Böttcher, and Franz Rammig. “The Design of PaMaNet the Paderborn Mobile Ad-Hoc Network.”https://doi.org/10.1145/1023783.1023807__In Proceedings of the Second International Workshop on Mobility Management &; Wireless Access Protocols, 2004.https://doi.org/10.1145/1023783.1023807 .

Bleckmann, Peter, Gunnar Schomaker, and Adrian Slowik. “Virtualization with Prefetching Abilities Based on ISCSI.”https://doi.org/10.1145/1162628.1162634__In Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 40–47, 2004.https://doi.org/10.1145/1162628.1162634 .

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

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

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

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

Volbert, Klaus. “Experimental Analysis of Adjustable Sectorized Topologies for Static Ad Hoc Networks.”https://doi.org/10.1145/1022630.1022646__In Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04, 2004.https://doi.org/10.1145/1022630.1022646 .

Rührup, Stefan, and Christian Schindelhauer. Traffic and Hop Efficient Position-Based Routing Using a Cell Structure. Heinz Nixdorf Institut, Universität Paderborn, 2004.

Brinkmann, André, Michael Heidebuer, Friedhelm Meyer auf der Heide, Ulrich  Rückert, Kay Salzwedel, and Mario Vodisek. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” In 21st IEEE Conference on Mass Storage Systems and Technologies / 12th NASA Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, 153--157. IEEE, 2004.

Sohler, Christian, and Valentina Damerow. “Smoothed Number of Extreme Points under Uniform Noise.” In Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04), 93–96, 2004.

Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.”https://doi.org/10.1007/978-3-540-30140-0_25__In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30140-0_25 .

Sohler, Christian, Jens Krokowski, Harald Räcke, and Matthias Westermann. “Reducing State Changes with a Pipeline Buffer.” In Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), 2004.

Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation for Clustering via Random Sampling.” In Automata, Languages and Programming (ICALP), 396–407, 2004.

Ziegler, Martin, and Vasco Brattka. “Computability in Linear Algebra.”https://doi.org/10.1016/j.tcs.2004.06.022__Theoretical Computer Science 326, no. 1–3 (2004): 187–211.https://doi.org/10.1016/j.tcs.2004.06.022 .

Ziegler, Martin. “Computable Operators on Regular Sets.”https://doi.org/10.1002/malq.200310107__In Computability and Complexity in Analysis, 50:392–404, 2004.https://doi.org/10.1002/malq.200310107 .

Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.”https://doi.org/10.1007/978-3-540-30140-0_49__In Proc. 12th Annual Symposium on Algorithms (ESA’04), 3221:544–55. Berlin, Heidelberg: Springer, 2004.https://doi.org/10.1007/978-3-540-30140-0_49 .