Bienkowski, M., &; Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer .https://doi.org/10.1007/11561071_72 

Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.

Bienkowski, M., Brinkmann, A., Korzeniowski, M., &; Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In Proceedings of the 4th International Conference on Networking (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-31956-6_49 

Bienkowski, M., Dynia, M., &; Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 365–376).https://doi.org/10.1007/978-3-540-31856-9_30 

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

Frahling, G., Indyk, P., &; Sohler, C. (2005). Sampling in dynamic data streams and applications. In Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05.https://doi.org/10.1145/1064092.1064116 

Köhler, S., Schindelhauer, C., &; Ziegler, M. (2005). On Approximating Real-World Halting Problems. In Fundamentals of Computation Theory. Berlin, Heidelberg.https://doi.org/10.1007/11537311_40 

Meer, K., &; Ziegler, M. (2005). An Explicit Solution to Post’s Problem over the Reals. In Fundamentals of Computation Theory. Berlin, Heidelberg.https://doi.org/10.1007/11537311_41 

Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In Proc. CiE 2005: New Computational Paradigms (Vol. 3526, pp. 562–571). Springer.https://doi.org/10.1007/11494645_68 

Ziegler, M. (2005). Computational Power of Infinite Quantum Parallelism. International Journal of Theoretical Physics, 44(11), 2059–2071.https://doi.org/10.1007/s10773-005-8984-0 

Dangelmaier, W., Mueck, B., Fischer, M., Mahajan, K., &;  Laroque, C. (2005). 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 (pp. 267–270).

Loeser, C., Drüke, I., &; Oesterdiekhoff, B. (2005).  Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In IEEE International Conference on Industrial Informatics (INDIN).

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

Bienkowski, M., Korzeniowski, M., &; Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg.https://doi.org/10.1007/11558989_20 

Bienkowski, M., &; Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg.https://doi.org/10.1007/11549345_1 

Bonorden, O., Gehweiler, J., &; Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808).https://doi.org/10.1007/11752578_96 

Bonorden, O., Gehweiler, J., &; Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846).https://doi.org/10.1007/11752578_101 

Bienkowski, M., Damerow, V., Meyer auf der Heide, F., &; Sohler, C. (2005). 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.

Leonardi, S., Meyer auf der Heide, F., &; Wagner, D. (Eds.). (2005). Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.

Ziegler, M. (2005). Stability versus speed in a computable algebraic model. Theoretical Computer Science, 14–26.https://doi.org/10.1016/j.tcs.2005.09.053 

Salzwedel, K. (2004). Data Distribution Algorithms for Storage Networks (Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O.,https://doi.org/10.1007/978-3-540-30217-9_4__Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30217-9_4 

Schweer, A., Leifhelm, M., Degener, B., Heering, O., Tannenbaum, S., Röglin, H.,  Plociennik, K. (2004). Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. In Parallel Problem Solving from Nature - PPSN VIII.

Brinkmann, A., Salzwedel, K., &; Vodisek, M. (2004). A case for virtualized arrays of RAID. In Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04 (pp. 9–16).https://doi.org/10.1145/1162628.1162630 

Schindelhauer, C., Böttcher, S., &; Rammig, F. (2004). The design of PaMaNet the Paderborn mobile ad-hoc network. In Proceedings of the second international workshop on Mobility management &; wireless access protocols.https://doi.org/10.1145/1023783.1023807 

Bleckmann, P., Schomaker, G., &; Slowik, A. (2004). Virtualization with prefetching abilities based on iSCSI. Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2, 40–47.https://doi.org/10.1145/1162628.1162634 

Klein, J., &; Zachmann, G. (2004). Point Cloud Surfaces using Geometric Proximity Graphs. Computers and Graphics, 28(6), 839–850.https://doi.org/10.1016/j.cag.2004.08.012 

Klein, J., &; Zachmann, G. (2004). Proximity Graphs for Defining Surfaces over Point Clouds. In Eurographics Symposium on Point-Based Grahics (SPBG’04) (pp. 131–138).

Klein, J., &; Zachmann, G. (2004). Nice and Fast Implicit Surfaces over Noisy Point Clouds. In SIGGRAPH 2004, Sketches.

Klein, J., &; Zachmann, G. (2004). Point Cloud Collision Detection. In Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004) (pp. 567–576).

Volbert, K. (2004). Experimental analysis of adjustable sectorized topologies for static ad hoc networks. Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04.https://doi.org/10.1145/1022630.1022646 

Rührup, S., &; Schindelhauer, C. (2004). Traffic and Hop Efficient Position-based Routing using a Cell Structure.

Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., &; Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler &; P. C. Hariharan (Eds.), 21st IEEE Conference on Mass Storage Systems and Technologies / 12th NASA Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA (pp. 153--157). IEEE.

Sohler, C., &; Damerow, V. (2004). Smoothed Number of Extreme Points under Uniform Noise. In Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04) (pp. 93–96).

Damerow, V., &; Sohler, C. (2004). Extreme Points Under Random Noise. In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30140-0_25 

Sohler, C., Krokowski, J., Räcke, H., &; Westermann, M. (2004). Reducing State Changes with a Pipeline Buffer. In Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004).

Sohler, C., &; Czumaj, A. (2004). Sublinear-Time Approximation for Clustering via Random Sampling. In Automata, Languages and Programming (ICALP) (pp. 396–407).

Ziegler, M., &; Brattka, V. (2004). Computability in linear algebra. Theoretical Computer Science, 326(1–3), 187–211.https://doi.org/10.1016/j.tcs.2004.06.022 

Ziegler, M. (2004). Computable operators on regular sets. Computability and Complexity in Analysis, 50(4–5), 392–404.https://doi.org/10.1002/malq.200310107 

Nüsken, M., &; Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate Polynomials. In Proc. 12th Annual Symposium on Algorithms (ESA’04) (Vol. 3221, pp. 544–555). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-30140-0_49 

Schindelhauer, C., Volbert, K., &; Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04) (Vol. 3341, pp. 805–821). Berlin, Heidelberg: Springer .https://doi.org/10.1007/978-3-540-30551-4_69 

Mueck, B., Dangelmaier, W., Laroque, C., Fischer, M., &; Kortenjan, M. (2004). Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations. In Simulation and Visualisation 2004 (pp. 73–83). Magdeburg: SCS European Publishing House.

Oesterdiekhoff, B. (2004). Transcoding von Webinhalten. Informatik Spektrum, 27(5), 448–452.

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

Bansal, V., Meyer auf der Heide, F., &; Sohler, C. (2004). Labeling Smart Dust. In 12th Annual European Symposium on Algorithms (ESA 2004) (Vol. 3221). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30140-0_9 

Bienkowski, M., Korzeniowski, M., &; Meyer auf der Heide, F. (2004). Fighting against two adversaries. In Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’04.https://doi.org/10.1145/1007912.1007923 

Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., &; Grünewald, M. (2004). Congestion, Dilation, and Energy in Radio Networks. Theory of Computing Systems, 343–370.https://doi.org/10.1007/s00224-004-1124-z 

Leonardi, S., Marchetti-Spaccamela, A., &; Meyer auf der Heide, F. (2004). Scheduling against an adversarial network. In SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures.https://doi.org/10.1145/1007912.1007936 

Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., &; Meyer auf der Heide, F. (2004). The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. Presence: Teleoperators and Virtual Environments, 617–637.https://doi.org/10.1162/1054746043280619 

Liu Jing, M., Ruehrup, S., Schindelhauer, C., Volbert, K., Dierkes, M., Bellgardt, A.,  Hilleringmann, U. (2004). Sensor Networks with More Features Using Less Hardware. In GOR/NGB Conference Tilburg 2004. Tilburg, Netherlands.