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.