Sibeyn, J. F.: Routing and sorting on circular arrays. Max-Planck-Institut für Informatik, Saarbrücken (1993), 20 pp.

Sibeyn, J.; Kaufmann, M.: Deterministic 1-k routing on meshes with applications to worm-hole routing. Max-Planck-Institut für Informatik, Saarbrücken (1993), 13 pp.

Sibeyn, J.; Kaufmann, M.; Chlebus, B. S.: Deterministic Permutation Routing on Meshes (Universität Passau, Technische Berichte, MIP-9301). Universität Passau, Passau, Germany (1993), 13 pp.

Smid, M.: An O(n log n) algorithm for finding a k-point subset with minimal L∞-diameter. Max-Planck-Institut für Informatik, Saarbrücken (1993), 17 pp.

Smid, M.; Datta, A.; Lenhof, H.-P.; Schwarz, C.: Static and dynamic algorithms for k-point clustering problems. Max-Planck-Institut für Informatik, Saarbrücken (1993), 20 pp.

Socher-Ambrosius, R.: A refined version of general E-unification. Max-Planck-Institut für Informatik, Saarbrücken (1993), 12 pp.

Socher-Ambrosius, R.: Unification of terms with exponents. Max-Planck-Institut für Informatik, Saarbrücken (1993), 21 pp.

Stuber, J.: Computing stable models by program transformation. Max-Planck-Institut für Informatik, Saarbrücken (1993), 15 pp.

Weidenbach, C.: Unification in sort theories and its applications. Max-Planck-Institut für Informatik, Saarbrücken (1993), 36 pp.

Dobrindt, K.; Mehlhorn, K.; Yvinec, M.: A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron, (1993)