Charatonik, W.: Direktionale Typen in der Logischen Programmierung. Habilitation, Universität des Saarlandes, Saarbrücken (2002)

Annen, T.: Advanced Shadow Map Parameterization. Diploma, Hochschule für Technik und Wirtschaft des Saarlandes, Saarbrücken (2002)

Michail, D.: Lobster- A Load Balanced P2P Content Sharing Network. Diploma, Universität Kreta, Heraklion (2002)

Baraque, R.: Effiziente Multiplikationsverfahren: ein numerischer Vergleich. Master, Universität des Saarlandes, Saarbrücken (2002)

Hemmer, M.: Reliable computation of planar and spatial arrangements of quadrics. Master, Universität des Saarlandes, Saarbrücken (2002)

Kessler, H.: Robust Computation of Visibility Maps. Master, Universität des Saarlandes, Saarbrücken (2002)

Ossamy, R.: TSP Cuts Outside the Template Paradigm. Master, Universität des Saarlandes, Saarbrücken (2002)

Rybalchenko, A.: A Model Checker based on Abstraction Refinement. Master, Universität des Saarlandes, Saarbrücken (2002)

Beldiceanu, N.; Carlsson, M.; Thiel, S.: Cost-filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint. Swedish Institute of Computer Science, Uppsala, Sweden (2002)

Charatonik, W.; Ganzinger, H.: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi. Max-Planck-Institut für Informatik, Saarbrücken (2002), 64 pp.

Charatonik, W.; Talbot, J.-M.: Atomic set constraints with projection. Max-Planck-Institut für Informatik, Saarbrücken (2002), 20 pp.

Drago, F.; Martens, W.; Myszkowski, K.; Seidel, H.-P.: Perceptual evaluation of tone mapping operators with regard to similarity and preference. Max-Planck-Institut für Informatik, Saarbrücken (2002), 30 pp.

Eigenwillig, A.; Schömer, E.; Wolpert, N.: Sweeping Arrangements of Cubic Segments Exactly and Efficiently. Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis (2002)

Gösele, M.; Kautz, J.; Lang, J.; Lensch, H. P. A.; Seidel, H.-P.: Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models. Max-Planck-Institut für Informatik, Saarbrücken (2002), 50 pp.

Grandoni, F.: Incrementally Maintaining the Number of l-cliques. Max-Planck-Institut für Informatik, Saarbrücken (2002), 10 pp.

Hert, S.; Polzin, T.; Kettner, L.; Schäfer, G.: Exp Lab: a tool set for computational experiments. Max-Planck-Institut für Informatik, Saarbrücken (2002), 59 pp.

Hoefer, M.: Performance of heuristic and approximation algorithms for the uncapacitated facility location problem. Max-Planck-Institut für Informatik, Saarbrücken (2002), 27 pp.

Katriel, I.; Sanders, P.; Träff, J. L.: A practical minimum spanning tree algorithm using the cycle property. Max-Planck-Institut für Informatik, Saarbrücken (2002), 21 pp.

Polzin, T.; Vahdati, S.: Using (sub)graphs of small width for solving the Steiner problem. Max-Planck-Institut für Informatik, Saarbrücken (2002), 9 pp.

Sanders, P.; Träff, J. L.: The factor algorithm for all-to-all communication on clusters of SMP nodes. Max-Planck-Institut für Informatik, Saarbrücken (2002), 8 pp.