B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast on parallel locality models,” Journal of Discrete Algorithms, pp. 151–166, 2003.

A. L. Rosenberg and F. Meyer auf der Heide, Eds., Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03. 2003.

O. Bonorden et al., “A holistic methodology for network processor design,” in 28th Annual IEEE International Conference on Local Computer Networks, 2003.

O. Bonorden, F. Meyer auf der Heide, and R. 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), 2002, pp. 2202–2208.

R. Wanka, “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), 2002, pp. 413–420.

J. Klein, J. Krokowski, and N. Cuntz, “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression,” in Proc. of 4. GI-Informatiktage, 2002, pp. 224–229.

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

M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,”10.1007/3-540-45706-2_134__2002, doi:10.1007/3-540-45706-2_134 .

K. Volbert, “A simulation environment for ad hoc networks using sector subdivision,”10.1109/empdp.2002.994324__2002, doi:10.1109/empdp.2002.994324 .

A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.

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

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

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

M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” Mathematical Logic Quarterly (MLQ), vol. 48, no. , pp. 157–181, 2002.

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

V. Brattka and M. Ziegler, “Computability of Linear Equations,” in Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 95–106.

B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling of Simulation Tools with a Walkthrough-System,” in Simulation und Visualisierung, 2002, pp. 71–84.

M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002.

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

J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “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.