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 .