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 .