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.

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

Rührup, Stefan, and Christian Schindelhauer. Traffic and Hop Efficient Position-Based Routing Using a Cell Structure. 2004.

Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” 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, IEEE, 2004, pp. 153--157.

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

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

Sohler, Christian, et al. “Reducing State Changes with a Pipeline Buffer.” Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), 2004.

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

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

Ziegler, Martin. “Computable Operators on Regular Sets.”10.1002/malq.200310107__Computability and Complexity in Analysis, vol. 50, no. 4–5, 2004, pp. 392–404, doi:10.1002/malq.200310107.

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

Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.”10.1007/978-3-540-30551-4_69__Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), vol. 3341, Springer , 2004, pp. 805–21, doi:10.1007/978-3-540-30551-4_69.

Mueck, Bengt, et al. “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations.” Simulation and Visualisation 2004, SCS European Publishing House, 2004, pp. 73–83.

Oesterdiekhoff, Brigitte. “Transcoding von Webinhalten.” Informatik Spektrum, vol. 27, no. 5, 2004, pp. 448–52.

Oesterdiekhoff, Brigitte. “Internet Premium Services for Flexible Format Distributed Devices.” Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04), 2004.

Bansal, Vikas, et al. “Labeling Smart Dust.”10.1007/978-3-540-30140-0_9__12th Annual European Symposium on Algorithms (ESA 2004), vol. 3221, 2004, doi:10.1007/978-3-540-30140-0_9.

Bienkowski, Marcin, et al. “Fighting against Two Adversaries.”10.1145/1007912.1007923__Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’04, 2004, doi:10.1145/1007912.1007923.

Meyer auf der Heide, Friedhelm, et al. “Congestion, Dilation, and Energy in Radio Networks.”10.1007/s00224-004-1124-z__Theory of Computing Systems, 2004, pp. 343–70, doi:10.1007/s00224-004-1124-z.

Leonardi, S., et al. “Scheduling against an Adversarial Network.”10.1145/1007912.1007936__SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004, doi:10.1145/1007912.1007936.

Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.”10.1162/1054746043280619__Presence: Teleoperators and Virtual Environments, 2004, pp. 617–37, doi:10.1162/1054746043280619.

Liu Jing, Michelle, et al. “Sensor Networks with More Features Using Less Hardware.” GOR/NGB Conference Tilburg 2004, 2004.

Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library.”10.1016/s0167-8191(02)00218-1__Parallel Computing, 2003, pp. 187–207, doi:10.1016/s0167-8191(02)00218-1.

Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.”10.1007/3-540-36574-5_12__Algorithms for Memory Hierarchies, vol. 2625, 2003, doi:10.1007/3-540-36574-5_12.

Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.

Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.”10.1109/ipdps.2003.1213107__Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003, doi:10.1109/ipdps.2003.1213107.

Mahlmann, Peter. Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web. 2003.

Volbert, Klaus, et al. “Directed Power-Variable Infrared Communication for the Mini Robot Khepera.” Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment, 2003, pp. 113–22.

Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of Time-Critical Collision Detection.” Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003), 2003, pp. 37–45.

Klein, Jan, and Gabriel10.1145/1008653.1008660__Zachmann. “Time-Critical Collision Detection Using an Average-Case Approach.”10.1145/1008653.1008660__10.1145/1008653.1008660__Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003), 2003, pp. 22–31, doi:10.1145/1008653.1008660.

Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.”10.1137/s0097539702419649__Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, doi:10.1137/s0097539702419649.

Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische Bildaufteilung.” Proceedings of 5. GI-Informatiktage 2003, 2003.