Boghossian, N.; Kohlbacher, O.; Lenhof, H.-P.: BALL: Biochemical Algorithms Library. Max-Planck-Institut für Informatik, Saarbrücken (1999), 20 pp.

Burnikel, C.; Mehlhorn, K.; Seel, M.: A simple way to recognize a correct Voronoi diagram of line segments. Max-Planck-Institut für Informatik, Saarbrücken (1999), 11 pp.

Charatonik, W.: Automata on DAG representations of finite trees. Max-Planck-Institut für Informatik, Saarbrücken (1999), 30 pp.

Cortier, V.; Ganzinger, H.; Jacquemard, F.; Veanes, M.: Decidable fragments of simultaneous rigid reachability. Max-Planck-Institut für Informatik, Saarbrücken (1999), 19 pp.

Crauser, A.; Ferragina, P.: A theoretical and experimental study on the construction of suffix arrays in external memory. Max-Planck-Institut für Informatik, Saarbrücken (1999), 40 pp.

Delzanno, G.; Raskin, J.-F.: Symbolic representation of upward-closed sets. Max-Planck-Institut für Informatik, Saarbrücken (1999), 24 pp.

Haber, J.; Seidel, H.-P.: A framework for evaluating the quality of lossy image compression. Max-Planck-Institut für Informatik, Saarbrücken (1999), 20 pp.

Henzinger, T. A.; Raskin, J.-F.; Schobbens, P.-Y.: Axioms for real-time logics. Max-Planck-Institut für Informatik, Saarbrücken (1999), 31 pp.

Henzinger, T. A.; Raskin, J.-F.; Schobbens, P.-Y.: Fully decidable logics, automata and classical theories for defining regular real-time languages. Max-Planck-Institut für Informatik, Saarbrücken (1999), 102 pp.

Nissen, M.: Integration of graph iterators into LEDA. Max-Planck-Institut für Informatik, Saarbrücken (1999), 39 pp.

Nissen, M.; Weihe, K.: How generic language extensions enable ''open-world'' design in Java. Max-Planck-Institut für Informatik, Saarbrücken (1999), 40 pp.

Nonnengart, A.: A deductive model checking approach for hybrid systems. Max-Planck-Institut für Informatik, Saarbrücken (1999), 40 pp.

Raskin, J.-F.: Proving a conjecture of Andreka on temporal logic. Max-Planck-Institut für Informatik, Saarbrücken (1999), 13 pp.

Raskin, J.-F.; Schobbens, P.-Y.: The logic of event clocks. Max-Planck-Institut für Informatik, Saarbrücken (1999), 41 pp.

Sanders, P.; Egner, S.; Korst, J.: Fast concurrent access to parallel disks. Max-Planck-Institut für Informatik, Saarbrücken (1999), 30 pp.

Sibeyn, J.: Ultimate parallel list ranking?. Max-Planck-Institut für Informatik, Saarbrücken (1999), 20 pp.

Vorobyov, S.: New lower bounds for the expressiveness and the higher-order Matching problem in the simply typed lambda calculus. Max-Planck-Institut für Informatik, Saarbrücken (1999), 20 pp.

Waldmann, U.: Cancellative superposition decides the theory of divisible torsion-free abelian groups. Max-Planck-Institut für Informatik, Saarbrücken (1999), 23 pp.

Wu, J.: Symmetries in logic programs. Max-Planck-Institut für Informatik, Saarbrücken (1999), 44 pp.

Banderier, C.: An Introduction to Analytic Number Theory, (1999)