Hanus, M.: Lazy unification with inductive simplification. Max-Planck-Institut für Informatik, Saarbrücken (1993), 20 pp.

Hanus, M.; Josephs, B.: A debugging model for functional logic programs. Max-Planck-Institut für Informatik, Saarbrücken (1993), 14 pp.

Johann, P.; Socher-Ambrosius, R.: Solving simplifications ordering constraints. Max-Planck-Institut für Informatik, Saarbrücken (1993), 16 pp.

Kapoor, S.; Smid, M.: New techniques for exact and approximate dynamic closest-point problems. Max-Planck-Institut für Informatik, Saarbrücken (1993), 29 pp.

Kučera, L.: Coloring k-colorable graphs in constant expected parallel time. Max-Planck-Institut für Informatik, Saarbrücken (1993), 14 pp.

Kučera, L.: Expected complexity of graph partitioning problems. Max-Planck-Institut für Informatik, Saarbrücken (1993), 16 pp.

Kučera, L.: Broadcasting through a noisy one-dimensional network. Max-Planck-Institut für Informatik, Saarbrücken (1993), 14 pp.

Kučera, L.: Randomized incremental construction of abstract Voronoi diagrams. Max-Planck-Institut für Informatik, Saarbrücken (1993), 29 pp.

Matthews, S.: A theory and its metatheory in FS 0. Max-Planck-Institut für Informatik, Saarbrücken (1993), 22 pp.

Mehlhorn, K.; Dobrindt, K.; Yvinec, M.: A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. Institut National de Recherche en Informatique et en Automatique, Sophia Antipolis, France (1993)

Mehlhorn, K.; Mutzel, P.; Näher, S.: An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm. Max-Planck-Institut für Informatik, Saarbrücken (1993), 20 pp.

Mehlhorn, K.; Sharir, M.; Welzl, E.: Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection. Max-Planck-Institut für Informatik, Saarbrücken (1993), 12 pp.

Mehlhorn, K.; Uhrig, C.: Maintaining dynamic sequences under equality-tests in polylogorithmic time. Max-Planck-Institut für Informatik, Saarbrücken (1993), 17 pp.

Näher, S.: LEDA-Manual Version 3.0. Max-Planck-Institut für Informatik, Saarbrücken (1993), 140 pp.

Ohlbach, H. J.: Translation methods for non-classical logics: an overview. Max-Planck-Institut für Informatik, Saarbrücken (1993), 25 pp.

Ohlbach, H. J.; Bader, F.: A multi-dimensional terminological knowledge representation language - preliminary version. Max-Planck-Institut für Informatik, Saarbrücken (1993), 17 pp.

Pietracaprina, A.; Pucci, G.; Sibeyn, J.: Constructive Deterministic PRAM Simulation on a Mesh-connected Computer. International Computer Science Institute, Berkeley (1993), 18 pp.

Posegga, J.; Schwind, C.: Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993. Max-Planck-Institut für Informatik, Saarbrücken (1993)

Rüb, C.: Lower bounds for merging on the hypercube. Max-Planck-Institut für Informatik, Saarbrücken (1993), 10 pp.

Sen, S.: Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range. Max-Planck-Institut für Informatik, Saarbrücken (1993), 12 pp.