Socher-Ambrosius, R.: A goal oriented strategy based on completion. Max-Planck-Institut für Informatik, Saarbrücken (1992), 14 pp.

Sogomonjan, E. S.; Goessel, M.: Self-testing and self-checking combinational circuits with weakly independent outputs. Max-Planck-Institut für Informatik, Saarbrücken (1992), 18 pp.

Szalas, A.: On correspondence between modal and classical logic: automated approach. Max-Planck-Institut für Informatik, Saarbrücken (1992), 17 pp.

Szalas, A.: On natural deduction in fixpoint logics. Max-Planck-Institut für Informatik, Saarbrücken (1992), 18 pp.

Wertz, U.: First-order theorem proving modulo equations. Max-Planck-Institut für Informatik, Saarbrücken (1992), 108 pp.

Zelikovsky, A.: A faster 11/6-approximation algorithm for the Steiner tree problem in graphs. Max-Planck-Institut für Informatik, Saarbrücken (1992), 8 pp.

Zelikovsky, A.: Minimum base of weighted k polymatroid and Steiner tree problem. Max-Planck-Institut für Informatik, Saarbrücken (1992), 9 pp.

Bachmair, L.: Associative-commutative reduction orderings. Max-Planck-Institut für Informatik, Saarbrücken (1991), 7 pp.

Bachmair, L.; Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Max-Planck-Institut für Informatik, Saarbrücken (1991), 24 pp.

Bockmayr, A.: Logic programming with pseudo-Boolean constraints. Max-Planck-Institut für Informatik, Saarbrücken (1991), 20 pp.

Cheriyan, J.; Hagerup, T.; Mehlhorn, K.: An o(n³)-time maximum-flow algorithm. Max-Planck-Institut für Informatik, Saarbrücken (1991), 30 pp.

Cheriyan, J.; Hagerup, T.; Mehlhorn, K.: A lower bound for the nondeterministic space complexity of contextfree recognition. Max-Planck-Institut für Informatik, Saarbrücken (1991), 4 pp.

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.