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

Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” Complex Systems 14, no. 3 (2003): 263--268.

Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.”https://doi.org/10.1007/978-3-540-24587-2_72__In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003.https://doi.org/10.1007/978-3-540-24587-2_72 .

Ziegler, Martin. “Fast Relative Approximation of Potential Fields.”https://doi.org/10.1007/978-3-540-45078-8_13__In Lecture Notes in Computer Science, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003.https://doi.org/10.1007/978-3-540-45078-8_13 .

Fischer, Matthias, Michael Grafe, Carsten Matysczok, Bengt Mueck, and Michael Schoo. “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, 5:170–77. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag, 2003.

Dangelmaier, Wilhelm, Werner  Franke, Bengt Mueck, and Matthias Fischer. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” In 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung, 123:141–51. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2003.

Fischer, Matthias, Michael Grafe, Carsten Matysczok, Michael Schoo, and Bengt Mueck. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” In 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung, 123:153–66. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.

Adler, Micah, Berthold Vöcking, Christian Sohler, Harald Räcke, and Naveen Sivadasan. “Randomized Pursuit-Evasion in Graphs.” Combinatorics, Probability &; Computing, 2003, 225–44.

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

Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).”https://doi.org/10.1524/itit.45.2.108.19606__It - Information Technology, 2003.https://doi.org/10.1524/itit.45.2.108.19606 .

Juurlink, Bernhardus, Petr Kolman, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Optimal Broadcast on Parallel Locality Models.”https://doi.org/10.1016/s1570-8667(03)00023-6__Journal of Discrete Algorithms, 2003, 151–66.https://doi.org/10.1016/s1570-8667(03)00023-6 .

Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, eds. Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.https://doi.org/10.1145/777412 .

Bonorden, Olaf, N. Bruls, U. Kastens, D. K. Le, Friedhelm Meyer auf der Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, and M. Thies. “A Holistic Methodology for Network Processor Design.”https://doi.org/10.1109/LCN.2003.1243185__In 28th Annual IEEE International Conference on Local Computer Networks, 2003.https://doi.org/10.1109/LCN.2003.1243185 .

Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “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), 2202–8, 2002.

Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.”https://doi.org/10.1007/3-540-36379-3_36__In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 413–20. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-36379-3_36 .

Klein, Jan, Jens Krokowski, and Nicolas Cuntz. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression.” In Proc. of 4. GI-Informatiktage, 224–29, 2002.

Benczúr, András, Uwe Glässer, and Tamás Lukovszki. “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks.” Proc. of 10th International Workshop on Abstract State Machines, LNCS, 2002.

Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”https://doi.org/10.1007/3-540-45706-2_134__In Proceedings of the 8th International Euro-Par Conference. Paderborn, Germany, 2002.https://doi.org/10.1007/3-540-45706-2_134 .

Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector Subdivision.”https://doi.org/10.1109/empdp.2002.994324__In Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2002.https://doi.org/10.1109/empdp.2002.994324 .

Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.

Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 2002, 83–92.

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

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

Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.”https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4__Mathematical Logic Quarterly (MLQ) 48, no.https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4__(2002): 157–81.https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4 .

Ziegler, Martin, Valentina Damerow, and Lukas Finschi. “Point Location Algorithms of Minimum Size.” In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.

Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.”https://doi.org/10.1007/978-0-387-35608-2_9__In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 95–106. Boston, MA, 2002.https://doi.org/10.1007/978-0-387-35608-2_9 .

Mueck, Bengt, Wilhelm Dangelmaier, Matthias Fischer, and Wolfram Klemisch. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” In Simulation Und Visualisierung, 71–84. Ghent, BE: SCS European Publishing House, 2002.

Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.”https://doi.org/10.1007/3-540-45465-9_77__In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-45465-9_77 .

Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Bernhard Vöcking, and Matthias’https://doi.org/10.1007/s00224-001-1045-z__Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.”https://doi.org/10.1007/s00224-001-1045-z__Theory of Computing Systems, 2002, 217–45.https://doi.org/10.1007/s00224-001-1045-z .

Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.”https://doi.org/10.1145/585740.585764__In Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002.https://doi.org/10.1145/585740.585764 .

Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert, and Matthias Grünewald. “Energy, Congestion and Dilation in Radio Networks.”https://doi.org/10.1145/564870.564910__In Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02, 2002.https://doi.org/10.1145/564870.564910 .

Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.”https://doi.org/10.1007/3-540-45706-2_133__In Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-45706-2_133 .

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

Salzwedel, Kay, Georg Hartmann, Carsten Wolff, and Robert Preis. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” In Proceedings of the PDPTA 2001, 1:463–70, 2001.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.”https://doi.org/10.1007/s004930170007__Combinatorica 21, no. 1 (2001): 95--138.https://doi.org/10.1007/s004930170007 .

Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.”https://doi.org/10.1007/3-540-48224-5_41__Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, 493–505.https://doi.org/10.1007/3-540-48224-5_41 .

Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 865–72, 2001.

Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”https://doi.org/10.1007/3-540-44676-1_22__Proceedings of the 9th Annual European Symposium on Algorithms (ESA), 2001, 266–77.https://doi.org/10.1007/3-540-44676-1_22 .

Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.”https://doi.org/10.1007/3-540-45294-x_21__In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.https://doi.org/10.1007/3-540-45294-x_21 .

Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller. “Factoring a Binary Polynomial of Degree over One Million.”https://doi.org/10.1145/504331.504333__ACM SIGSAM Bulletin, 2001, 16–18.https://doi.org/10.1145/504331.504333 .

Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.”https://doi.org/10.1007/3-540-45335-0_23__In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45335-0_23 .

Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” In Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), AA:155–64, 2001.

Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” In Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 181–84, 2001.

Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” In Proc. of 3. GI-Informatiktage 2001, 275–78. Bad Schussenried, 2001.

Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.”https://doi.org/10.1145/383259.383299__In Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001.https://doi.org/10.1145/383259.383299 .

Meyer auf der Heide, Friedhelm. “Data Management in Networks.”https://doi.org/10.1007/3-540-45477-2_2__In Graph-Theoretic Concepts in Computer Science, Vol. 2204.https://doi.org/10.1007/3-540-45477-2_2__Lecture Notes in Computer Science. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45477-2_2 .

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.”https://doi.org/10.1007/3-540-45718-6_68__In Computational Science - ICCS 2001. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45718-6_68 .

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

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

Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Vol. 90. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.

Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. PUB-Library, Release 7.0, User Guide and Function Reference, 2000.

Scheideler, Christian. Probabilistic Methods for Coordination Problems, 2000.

Bednara, M., O. Beyer, J. Teich, and Rolf Wanka. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.”https://doi.org/10.1109/asap.2000.862400__In Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308, 2000.https://doi.org/10.1109/asap.2000.862400 .

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.”https://doi.org/10.1007/s002240010006__Theory Comput. Syst. 33, no. 5/6 (2000): 337--391.https://doi.org/10.1007/s002240010006 .

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.”https://doi.org/10.1137/S0097539799353431__SIAM J. Comput. 30, no. 4 (2000): 1126--1155.https://doi.org/10.1137/S0097539799353431 .

Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.

Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.

Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.

Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.

Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.

Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000.

Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.”https://doi.org/10.1007/s00453-005-1197-3__In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 585–614, 2000.https://doi.org/10.1007/s00453-005-1197-3 .

Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.”https://doi.org/10.1007/3-540-45253-2_15__In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000.https://doi.org/10.1007/3-540-45253-2_15 .

Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.”https://doi.org/10.1007/3-540-44411-4_34__In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000.https://doi.org/10.1007/3-540-44411-4_34 .

Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 73–79, 2000.

Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.”https://doi.org/10.1145/355483.355490__Journal of the ACM 45 (2000): 944–67.https://doi.org/10.1145/355483.355490 .

Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.

Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann. “Data Management in Hierarchical Bus Networks.”https://doi.org/10.1145/341800.341814__In Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000.https://doi.org/10.1145/341800.341814 .

Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Caching in Networks.” In SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 430–439, 2000.

Meyer auf der Heide, Friedhelm, Mirosaw Kutyowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.”https://doi.org/10.1007/3-540-44520-x_59__In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000.https://doi.org/10.1007/3-540-44520-x_59 .

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention Resolution in Hashing Based Shared Memory Simulations.”https://doi.org/10.1137/s009753979529564x__SIAM Journal on Computing, 2000, 1703–39.https://doi.org/10.1137/s009753979529564x .

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” ForschungsForum Paderborn, 2000, 112–16.

Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.”https://doi.org/10.1109/ipps.1999.760442__In Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104, 1999.https://doi.org/10.1109/ipps.1999.760442 .

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.”https://doi.org/10.1007/s002240000123__Theory Comput. Syst. 32, no. 3 (1999): 387--420.https://doi.org/10.1007/s002240000123 .

Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.

Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver, 1999.

Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 136–41, 1999.

Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.

Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.”https://doi.org/10.1007/3-540-48447-7_20__In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 193–204, 1999.https://doi.org/10.1007/3-540-48447-7_20 .

Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.”https://doi.org/10.1145/305619.305637__In Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 165–74, 1999.https://doi.org/10.1145/305619.305637 .

Sohler, Christian. “Generating Random Star-Shaped Polygons.” In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 174–77, 1999.

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.”https://doi.org/10.1006/jagm.1998.0980__Journal of Algorithms, 1999, 105–31.https://doi.org/10.1006/jagm.1998.0980 .

Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating Weighted Jobs in Parallel.”https://doi.org/10.1007/s002240000119__Theory of Computing Systems, 1999, 281–300.https://doi.org/10.1007/s002240000119 .

Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International Workshop on Communication and Data Management in Large Networks.”https://doi.org/10.1007/978-3-662-01069-3_47__In Informatik Aktuell. Berlin, Heidelberg, 1999.https://doi.org/10.1007/978-3-662-01069-3_47 .

Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”https://doi.org/10.1007/3-540-48481-7_9__In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999.https://doi.org/10.1007/3-540-48481-7_9 .

Vöcking, Berthold. Static and Dynamic Data Management in Networks. Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.

Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.

Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”https://doi.org/10.1007/3-540-68530-8_14__In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998.https://doi.org/10.1007/3-540-68530-8_14 .

Fischer, Matthias, Tamas Lukovszki, and Martin  Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering, 2nd International Workshop, WAE ’98, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998.

Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.

Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. Universität Paderborn, 1998.

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”https://doi.org/10.1007/s002240000096__Theory Comput. Syst. 31, no. 4 (1998): 425--449.https://doi.org/10.1007/s002240000096 .

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998.https://doi.org/10.1007/BFb0052928 .

Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.”https://doi.org/10.1016/s0304-3975(97)86791-6__Theoretical Computer Science 196 (1998): 181–200.https://doi.org/10.1016/s0304-3975(97)86791-6 .