Berberich, E.; Eigenwillig, A.; Emiris, I.; Fogel, E.; Hemmer, M.; Halperin, D.; Kakargias, A.; Kettner, L.; Mehlhorn, K.; Pion, S. et al.; Schömer, E.; Teillaud, M.; Wein, R.; Wolpert, N.: An empirical comparison of software for constructing arrangements of curved arcs. INRIA, Sophia Antipolis (2004), 11 S.

Berberich, E.; Eigenwillig, A.; Hemmer, M.; Hert, S.; Kettner, L.; Mehlhorn, K.; Reichel, J.; Schmitt, S.; Schömer, E.; Weber, D. et al.; Wolpert, N.: EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. INRIA, Sophia Antipolis (2004), 8 S.

Blanchet, B.: Automatic Proof of Strong Secrecy for Security Protocols. NWG 1 - Blanchet, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany (2004)

Chandran, L. S.; Sivadasan, N.: On the Hadwiger's conjecture for graph products. Max-Planck-Institut für Informatik, Saarbrücken (2004), 10 S.

Chandran, L. S.; Sivadasan, N.: On the Hadwiger's Conjecture for Graphs Products. Max-Planck-Institut für Informatik, Saarbrücken, Germany (2004)

Funke, S.; Mehlhorn, K.; Schmitt, S.; Burnikel, C.; Fleischer, R.; Schirra, S.: The LEDA class real number - extended version. INRIA, Sophia Antipolis (2004), 2 S.

Hemmer, M.; Kettner, L.; Schömer, E.: Effects of a modular filter on geometric applications. INRIA, Sophia Antipolis (2004), 7 S.

Kettner, L.; Mehlhorn, K.; Pion, S.; Schirra, S.; Yap, C.: Classroom examples of robustness problems in geometric computations (ECG Technical Report, 3221). INRIA, Sophia Antipolis (2004), 12 S.

Klein, C.: A fast root checking algorithm. INRIA, Sophia Antipolis (2004), 11 S.

Krandick, W.; Mehlhorn, K.: New bounds for the Descartes method. Drexel University, Philadelphia, Pa. (2004), 18 S.

Sanders, P.; Pettie, S.: A simpler linear time 2/3-epsilon approximation. Max-Planck-Institut für Informatik, Saarbrücken (2004), 7 S.

Sanders, P.; Pettie, S.: A simpler linear time 2/3 - epsilon approximation for maximum weight matching. Max-Planck-Institut für Informatik, Saarbrücken (2004), 10 S.

Schmitt, S.: Common subexpression search in LEDA_reals: a study of the diamond-operator. INRIA, Sophia Antipolis (2004), 5 S.

Schmitt, S.: Improved separation bounds for the diamond operator. INRIA, Sophia Antipolis (2004), 13 S.

Sivadasan, N.; Sanders, P.; Skutella, M.: Online scheduling with bounded migration. Max-Planck-Institut für Informatik, Saarbrücken (2004), 21 S.

Dietrich, A.; Wald, I.; Slusallek, P.: Interaktive Visualisierung eines hoch komplexen Boeing 777 Modells, Informatik Spektrum 27, S. 394 - 394 (2004)