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

Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30217-9_4

Schweer A, Leifhelm M, Degener B, 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 A, Salzwedel K, Vodisek M. A case for virtualized arrays of RAID. In: Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04. ; 2004:9-16. doi:10.1145/1162628.1162630

Schindelhauer C, Böttcher S, Rammig F. The design of PaMaNet the Paderborn mobile ad-hoc network. In: Proceedings of the Second International Workshop on Mobility Management &; Wireless Access Protocols. ; 2004. doi:10.1145/1023783.1023807

Bleckmann P, Schomaker G, Slowik A. Virtualization with prefetching abilities based on iSCSI. In: Proceeding of International Workshop on Storage Network Architecture and Parallel I/O. ; 2004:40-47. doi:10.1145/1162628.1162634

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

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

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

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

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

Rührup S, Schindelhauer C. Traffic and Hop Efficient Position-Based Routing Using a Cell Structure.; 2004.

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

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

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

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

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

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

Ziegler M. Computable operators on regular sets. In: Computability and Complexity in Analysis. Vol 50. ; 2004:392-404. doi:10.1002/malq.200310107

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

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

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

Oesterdiekhoff B. Transcoding von Webinhalten. Informatik Spektrum. 2004;27(5):448-452.

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

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

Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Fighting against two adversaries. In: 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 F, Schindelhauer C, Volbert K, Grünewald M. Congestion, Dilation, and Energy in Radio Networks. Theory of Computing Systems. 2004:343-370. doi:10.1007/s00224-004-1124-z

Leonardi S, Marchetti-Spaccamela A, Meyer auf der Heide F. Scheduling against an adversarial network. In: SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. ; 2004. doi:10.1145/1007912.1007936

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

Liu Jing M, Ruehrup S, Schindelhauer C, et al. Sensor Networks with More Features Using Less Hardware. In: GOR/NGB Conference Tilburg 2004. Tilburg, Netherlands; 2004.

Bonorden O, Juurlink B, von Otte I, Rieping I. The Paderborn University BSP (PUB) library. Parallel Computing. 2003:187-207. doi:10.1016/s0167-8191(02)00218-1

Salzwedel KA. Algorithmic Approaches for Storage Networks. Algorithms for Memory Hierarchies. 2003;2625. doi:10.1007/3-540-36574-5_12

Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M, Rückert U. Storage Management as Means to cope with Exponential Information Growth. In: Proceedings of SSGRR 2003. ; 2003.

Rührup S, Schindelhauer C, Volbert K, Grünewald M. Performance of distributed algorithms for topology control in wireless networks. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS). ; 2003. doi:10.1109/ipdps.2003.1213107

Mahlmann P. Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web.; 2003.

Volbert K, Grünewald M, Schindelhauer C, Rückert U. Directed power-variable infrared communication for the mini robot Khepera. In: Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment. ; 2003:113-122.

Klein J, Zachmann G. ADB-Trees: Controlling the Error of Time-Critical Collision Detection. In: Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003). ; 2003:37-45.

Klein J,10.1145/1008653.1008660__Zachmann G. Time-Critical Collision Detection Using an Average-Case Approach. In: 10.1145/1008653.1008660__Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003). ; 2003:22-31. doi:10.1145/1008653.1008660

Fomin FV, Thilikos DM. Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003). ; 2003. doi:10.1137/s0097539702419649

Terbahl M, Krokowski J. Verteiltes Rendern durch dynamische Bildaufteilung. In: Proceedings of 5. GI-Informatiktage 2003. ; 2003.

Ziegler M. Stability versus Speed in a Computable Algebraic Model. In: Proc. 5th Conference on Real Numbers and Computers (RN), INRIA. ; 2003:47-64.

Ziegler M. Computable Operators on Regular Sets. In: Computability and Complexity in Analysis. Vol 302-8/2003. Informatik Berichte. ; 2003:389-406.

Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17

Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.

Mueck B, Dangelmaier W, Fischer M. Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In: 15th European Simulation Symposium (ESS 2003). SCS - Europe; 2003:367-371.

Magen A, Ergun F, Sohler C, et al. Sublinear Approximation of Euclidean Minimum Spanning Tree. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003). ; 2003:813–822.

Bienkowski M, Korzeniowski M, Räcke H. A practical algorithm for constructing oblivious routing schemes. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03. ; 2003. doi:10.1145/777412.777418

Rust C, Stappert F, Lukovszki T. A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In: 7th World Multiconference on Systemics, Cybernetics and Informatics. ; 2003.

Schindelhauer C, Lukovszki T, Rührup S, Volbert K. Worst case mobility in ad hoc networks. In: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA). ; 2003. doi:10.1145/777412.777448

Azar Y, Cohen E, Fiat A, Kaplan H, Racke H. Optimal oblivious routing in polynomial time. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03. ; 2003. doi:10.1145/780542.780599

Gehweiler J. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. Universität Paderborn; 2003.

Hamann H. Definition and Behavior of Langton’s Ant in Three Dimensions. Complex Systems. 2003;14(3):263--268.

Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03). Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715. doi:10.1007/978-3-540-24587-2_72

Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack J, Smid M, Algorithms and Data Structures. WADS 2003, eds. Lecture Notes in Computer Science. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2003. doi:10.1007/978-3-540-45078-8_13

Fischer M, Grafe M, Matysczok C, Mueck B, Schoo M. Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In: Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management. Vol 5. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag; 2003:170-177.

Dangelmaier W,  Franke W, Mueck B, Fischer M. Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In: 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2003:141-151.

Fischer M, Grafe M, Matysczok C, Schoo M, Mueck B. Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. In: 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003:153-166.

Adler M, Vöcking B, Sohler C, Räcke H, Sivadasan N. Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability &; Computing. 2003:225-244.

Sohler C. Property Testing and Geometry. Vol 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003.

Meyer auf der Heide F. Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). it - Information Technology. 2003. doi:10.1524/itit.45.2.108.19606

Juurlink B, Kolman P, Meyer auf der Heide F, Rieping I. Optimal broadcast on parallel locality models. Journal of Discrete Algorithms. 2003:151-166. doi:10.1016/s1570-8667(03)00023-6

Rosenberg AL, Meyer auf der Heide F, eds. Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03.; 2003. doi:10.1145/777412

Bonorden O, Bruls N, Kastens U, et al. A holistic methodology for network processor design. In: 28th Annual IEEE International Conference on Local Computer Networks. ; 2003. doi:10.1109/LCN.2003.1243185

Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA). ; 2002:2202-2208.

Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG). Berlin, Heidelberg; 2002:413-420. doi:10.1007/3-540-36379-3_36

Klein J, Krokowski J, Cuntz N. Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression. In: Proc. of 4. GI-Informatiktage. ; 2002:224-229.

Benczúr A, Glässer U, Lukovszki T. Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks. Proc of 10th International Workshop on Abstract State Machines, LNCS. Published online 2002.

Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance of Resource Efficient Wireless Network Topologies. In: Proceedings of the 8th International Euro-Par Conference. ; 2002. doi:10.1007/3-540-45706-2_134

Volbert K. A simulation environment for ad hoc networks using sector subdivision. In: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing. ; 2002. doi:10.1109/empdp.2002.994324

Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.

Sohler C, Czumaj A. Abstract Combinatorial Programs and Efficient Property Testers. Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS). 2002:83-92.

Lukovszki T, Benczúr A. A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn; 2002.

Ziegler M. Zur Berechenbarkeit reeller geometrischer Probleme. Vol 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002.

Ziegler M. Computability on Regular Subsets of Euclidean Space. Mathematical Logic Quarterly (MLQ). 2002;48():157-181. doi:10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4

Ziegler M, Damerow V, Finschi L. Point Location Algorithms of Minimum Size. In: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02). ; 2002.

Brattka V, Ziegler M. Computability of Linear Equations. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science. Boston, MA; 2002:95-106. doi:10.1007/978-0-387-35608-2_9

Mueck B, Dangelmaier W, Fischer M, Klemisch W. Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In: Simulation Und Visualisierung. Ghent, BE: SCS European Publishing House; 2002:71-84.

Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion in Graphs. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45465-9_77

Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of Computing Systems. Published online 2002:217-245. doi:10.1007/s00224-001-1045-z

Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02. ; 2002. doi:10.1145/585740.585764

Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Energy, congestion and dilation in radio networks. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02. ; 2002. doi:10.1145/564870.564910

Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing, Mobile Networks. In: Euro-Par 2002 Parallel Processing. Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45706-2_133

Schröder K. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Vol 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2001.

Salzwedel K, Hartmann G, Wolff C, Preis R. Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In: Proceedings of the PDPTA 2001. Vol 1. ; 2001:463-470.

Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138. doi:10.1007/s004930170007

Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.

Czumaj A, Sohler C. Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505. doi:10.1007/3-540-48224-5_41

Sohler C, Czumaj A. Soft Kinetic Data Structures. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms. ; 2001:865-872.

Sohler C, Czumaj A. Property Testing with Geometric Queries. Proceedings of the 9th Annual European Symposium on Algorithms (ESA). 2001:266-277. doi:10.1007/3-540-44676-1_22

Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS. ; 2001. doi:10.1007/3-540-45294-x_21

Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin. 2001:16-18. doi:10.1145/504331.504333

Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23

Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001). Vol AA. ; 2001:155-164.

Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01). ; 2001:181-184.

Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: Proc. of 3. GI-Informatiktage 2001. Bad Schussenried; 2001:275-278.

Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized z-buffer algorithm. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01. ; 2001. doi:10.1145/383259.383299

Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic Concepts in Computer Science. Vol 2204.10.1007/3-540-45477-2_2__Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2

Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45718-6_68

Meyer auf der Heide F, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1

Rieping I. Communication in Parallel Systems-Models, Algorithms and Implementations. Vol 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.