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

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 
LibreCat: /record/19692
DOI: 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.
LibreCat: /record/19693

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 
LibreCat: /record/19800
DOI: 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 
LibreCat: /record/19807
DOI: 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 
LibreCat: /record/19851
DOI: 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 
LibreCat: /record/19879
DOI: 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).
LibreCat: /record/19883

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

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

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 
LibreCat: /record/26411
DOI: 10.1145/1022630.1022646

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

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.
LibreCat: /record/17346

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).
LibreCat: /record/18777

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 
LibreCat: /record/18778
DOI: 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).
LibreCat: /record/18785

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

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 
LibreCat: /record/17986
DOI: 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 
LibreCat: /record/18260
DOI: 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 
LibreCat: /record/18263
DOI: 10.1007/978-3-540-30140-0_49