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 S.

Fifth Biennial Report: June 1999 - August 2001 (Biennial Report / Max-Planck-Institut für Informatik, 5). Max-Planck-Institut für Informatik, Saarbrücken (2001), 278 S.

Björklund, H.; Petersson, V.; Vorobyov, S.: Experiments with iterative improvement algorithms on completely unimodel hypercubes. Max-Planck-Institut für Informatik, Saarbrücken (2001), 25 S.

Choi, S. W.; Seidel, H.-P.: Linear one-sided stability of MAT for weakly injective domain. Max-Planck-Institut für Informatik, Saarbrücken (2001), 18 S.

Csaba, B.; Lodha, S.: A Randomized On-line Algorithm for the k-Server Problem on a Line. DIMACS-Center for Discrete Mathematics & Theoretical Computer Science, Piscataway, NJ (2001)

Daubert, K.; Heinrich, W.; Kautz, J.; Dischler, J.-M.; Seidel, H.-P.: Efficient light transport using precomputed visibility. Max-Planck-Institut für Informatik, Saarbrücken (2001), 32 S.

de Nivelle, H.; Schulz, S.: Proceeding of the Second International Workshop of the Implementation of Logics. Max-Planck-Institut für Informatik, Saarbrücken (2001), 102 S.

Hert, S.; Hoffmann, M.; Kettner, L.; Pion, S.; Seel, M.: An adaptable and extensible geometry kernel. Max-Planck-Institut für Informatik, Saarbrücken (2001), 27 S.

Krysta, P.: Approximating minimum size 1,2-connected networks. Max-Planck-Institut für Informatik, Saarbrücken (2001), 22 S.

Lensch, H. P. A.; Gösele, M.; Seidel, H.-P.: A framework for the acquisition, processing and interactive display of high quality 3D models. Max-Planck-Institut für Informatik, Saarbrücken (2001), 39 S.

Lensch, H. P. A.; Kautz, J.; Gösele, M.; Heidrich, W.; Seidel, H.-P.: Image-based reconstruction of spatially varying materials. Max-Planck-Institut für Informatik, Saarbrücken (2001), 20 S.

Lensch, H. P. A.; Kautz, J.; Gösele, M.; Seidel, H.-P.: A framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web. Max-Planck-Institut für Informatik, Saarbrücken (2001), 20 S.

Meyer, U.: Directed single-source shortest-paths in linear average-case time. Max-Planck-Institut für Informatik, Saarbrücken (2001), 32 S.

Polzin, T.; Vahdati, S.: Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches. Max-Planck-Institut für Informatik, Saarbrücken (2001), 24 S.

Polzin, T.; Vahdati, S.: Partitioning techniques for the Steiner problem. Max-Planck-Institut für Informatik, Saarbrücken (2001), 21 S.

Polzin, T.; Vahdati, S.: On Steiner trees and minimum spanning trees in hypergraphs. Max-Planck-Institut für Informatik, Saarbrücken (2001), 15 S.

Seel, M.: Implementation of planar Nef polyhedra. Max-Planck-Institut für Informatik, Saarbrücken (2001), 345 S.

Sofronie-Stokkermans, V.: Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators. Max-Planck-Institut für Informatik, Saarbrücken (2001), 41 S.

Waldmann, U.: Superposition and chaining for totally ordered divisible abelian groups. Max-Planck-Institut für Informatik, Saarbrücken (2001), 40 S.

Althaus, E.; Kohlbacher, O.; Lenhof, H.-P.; Müller, P.: A branch and cut algorithm for the optimal solution of the side-chain placement problem. (2000), 26 S.