Basin, D.; Giunchiglia, F.; Traverso, P.: Automating Meta-Theory Creation and System Extension. In: Trends in Artificial Intelligence, S. 48 - 57 (Hg. Ardizzone, E.; Gaglio, S.; Sorbello, F.). 2nd Congress of the Italian Association for Artificial Intelligence, Palermo, Italy, 29. Oktober 1991 - 31. Oktober 1991. Springer, Berlin (1991)

Basin, D.; Howe, D.: Some Normalization Properties of Martin-Löf's Type Theory, and Applications. In: Theoretical Aspects of Computer Software, S. 475 - 494 (Hg. Ito, T.; Meyer, A. R.). International Conference on Theoretical Aspects of Computer Software, Sendaj, Japan, 24. September 1991 - 27. September 1991. Springer, Berlin (1991)

Bast, H.; Hagerup, T.: Fast and Reliable Parallel Hashing. In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), S. 50 - 61. Untitled Event, Hilton Head Island, South Carolina, USA, 21. Juli 2001 - 25. Juli 2001. ACM, New York, NY, USA (1991)

Baumeister, H.: Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution. In: Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT '91), S. 103 - 120 (Hg. Abramsky, S.; Maibaum, T. S. E.). Untitled Event, Brighton, UK, 1991. Springer, Berlin, Germany (1991)

Cunningham, J.; Gabbay, D. M.; Ohlbach, H. J.: Towards the MEDLAR Framework. In: ESPRIT '91 Conference Proceedings, S. 822 - 841. Commission of the European Communities, Brussels, Belgium (1991)

Feldmann, A.; Sgall, J.; Teng, S.-H.: Dynamic Scheduling on Parallel Machines. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, S. 111 - 120. 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 01. Oktober 1991 - 04. Oktober 1991. IEEE Computer Society, Los Alamitos, CA (1991)

Fleischer, R.; Jung, H.; Mehlhorn, K.: A Time-Randomness Tradeoff for Communication Complexity. In: Distributed Algorithms, 4th International Workshop, S. 390 - 401. Untitled Event, Bari, Italy, 24. September 1990. Springer, Berlin, Germany (1991)

Hanus, M.: Efficient Implementation of Narrowing and Rewriting. In: Processing Declarative Knowledge, S. 344‒365 (Hg. Boley, H.; Richter, M.M.). Intern. Workshop on Processing Declarative Knowledge, Kaiserslautern, Germany, 01. Juli 1991 - 03. Juli 1991. Springer, Berlin (1991)

Hanus, M.: Parametric Order‐sorted Types in Logic Programming. In: TAPSOFT‐91, S. 181‒200 (Hg. Abramsky, S.; Maibaum, T.S.E.). International Joint Conference on Theory and Practice of Software Development, Brighton, UK, 08. April 1991 - 12. April 1991. Springer, Berlin (1991)

Krischer, S.; Bockmayr, A.: Detecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test. In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA '91), S. 74 - 85 (Hg. Book, R.). Untitled Event, Como, Italy, 1991. Springer, Berlin, Germany (1991)

Lenhof, H.-P.; Smid, M.: An optimal construction method for generalized convex layers. In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, S. 349 - 363 (Hg. Hsu, W.L.; Lee, R.C.T.). Untitled Event, Taipei, Republic of China, 16. Dezember 1991 - 18. Dezember 1991. Springer, Berlin, Germany (1991)

Ohlbach, H. J.; Herzig, A.: Parameter Structures for Parametrized Modal Operators. In: Proc. Intern. Joint Conference on Artificial Intelligence (IJCAI'91), S. 512 - 517 (Hg. Mylopoulos, J.; Reiter, R.). 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, 24. August 1991 - 30. August 1991. Morgan Kaufmann, San Mateo, CA (1991)

Ohlbach, H. J.; Siekmann, J.: The Markgraf Karl Refutation Procedure. In: Computational Logic, Essays in Honor of Alan Robinson, S. 41 - 112 (Hg. Lassez, J. L.; Plotkin, G.). MIT Press, Cambridge, Mass. (1991)

Waldmann, U.: Compatibility of Order-sorted Rewrite Rules. In: Conditional and Typed Rewriting Systems, S. 407 - 416 (Hg. Kaplan, S.; Okada, M.). Second International CTRS Workshop, Montreal, Canada, 11. Juni 1990 - 14. Juni 1990. Springer, Berlin (1991)

Reinold, M.: Transformation in dichten Wäldern. Master, Universität des Saarlandes, Saarbrücken (1991)

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

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

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

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

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 S.