Cheriyan, J.; Mehlhorn, K.: Algorithms for dense graphs and networks. Max-Planck-Institut für Informatik, Saarbrücken (1991), 29 pp.

Eisinger, N.; Ohlbach, H. J.: Deduction systems based on resolution. Max-Planck-Institut für Informatik, Saarbrücken (1991), 68 pp.

Fleischer, R.: A tight lower bound for the worst case of bottom-up-heapsort. Max-Planck-Institut für Informatik, Saarbrücken (1991), 13 pp.

Fleischer, R.; Mehlhorn, K.; Rote, G.; welzl, E.: Simultaneous inner and outer aproximation of shapes. Max-Planck-Institut für Informatik, Saarbrücken (1991), 24 pp.

Hagerup, T.: On a compaction theorem of ragde. Max-Planck-Institut für Informatik, Saarbrücken (1991), 6 pp.

Hagerup, T.: Fast parallel space allocation, estimation an integer sorting. Max-Planck-Institut für Informatik, Saarbrücken (1991), 28 pp.

Heffernan, P. J.; Schirra, S.: Approximate decision algorithms for point set congruence. Max-Planck-Institut für Informatik, Saarbrücken (1991), 25 pp.

Hromkovic, J.; Müller, V.; Sýkora, O.; Vrto, I.: On embeddings in cycles. Max-Planck-Institut für Informatik, Saarbrücken (1991), 22 pp.

Hustadt, U.: A complete transformation system for polymorphic higher-order unification. Max-Planck-Institut für Informatik, Saarbrücken (1991), 22 pp.

Lenhof, H.-P.; Smid, M.: An optimal construction method for generalized convex layers. Max-Planck-Institut für Informatik, Saarbrücken (1991), 25 pp.

Mehlhorn, K.; Sharir, M.; Welzl, E.: Tail estimates for the space complexity of randomized incremantal algorithms. Max-Planck-Institut für Informatik, Saarbrücken (1991), 8 pp.

Michaylov, S.; Pfenning, F.: Natural semantics and some of its meta-theory in Elf. Max-Planck-Institut für Informatik, Saarbrücken (1991), 26 pp.

Paterson, M. S.; Schröder, H.; Sýkora, O.; Vrto, I.: Optimal embedding of a toroidal mesh in a path. Max-Planck-Institut für Informatik, Saarbrücken (1991), 6 pp.

Schmidt, R. A.: Algebraic terminological representation. Max-Planck-Institut für Informatik, Saarbrücken (1991), 113 pp.

Schwarz, C.; Smid, M.: An optimal algorithm for the on-line closest-pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 11 pp.

Schwarz, C.; Smid, M.: An O(n log n log log n) algorithm for the on-line closes pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 21 pp.

Smid, M.: Maintaining the minimal distance of a point set in polylogarithmic time (revised version). Max-Planck-Institut für Informatik, Saarbrücken (1991), 17 pp.

Smid, M.: Range trees with slack parameter. Max-Planck-Institut für Informatik, Saarbrücken (1991), 11 pp.

Smid, M.: Dynamic rectangular point location, with an application to the closest pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 28 pp.

Sýkora, O.; Vrto, I.: Edge separators for graphs of bounded genus with applications. Max-Planck-Institut für Informatik, Saarbrücken (1991), 10 pp.