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

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

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

Ziegler M. Computability on Regular Subsets of Euclidean Space. Mathematical Logic Quarterly (MLQ). 2002;48():157-181. doi:10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4

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

Brattka V, Ziegler M. Computability of Linear Equations. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science. Boston, MA; 2002:95-106. doi:10.1007/978-0-387-35608-2_9

Mueck B, Dangelmaier W, Fischer M, Klemisch W. Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In: Simulation Und Visualisierung. Ghent, BE: SCS European Publishing House; 2002:71-84.

Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion in Graphs. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45465-9_77

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

Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. 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. doi:10.1145/585740.585764

Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Energy, congestion and dilation in radio networks. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02. ; 2002. doi:10.1145/564870.564910

Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing, Mobile Networks. In: Euro-Par 2002 Parallel Processing. Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45706-2_133

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

Salzwedel K, Hartmann G, Wolff C, Preis R. Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In: Proceedings of the PDPTA 2001. Vol 1. ; 2001:463-470.

Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138. doi:10.1007/s004930170007

Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.

Czumaj A, Sohler C. Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505. doi:10.1007/3-540-48224-5_41

Sohler C, Czumaj A. Soft Kinetic Data Structures. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms. ; 2001:865-872.

Sohler C, Czumaj A. Property Testing with Geometric Queries. Proceedings of the 9th Annual European Symposium on Algorithms (ESA). 2001:266-277. doi:10.1007/3-540-44676-1_22

Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS. ; 2001. doi:10.1007/3-540-45294-x_21