Conference Paper (16)
21.
Conference Paper
Automating Meta-Theory Creation and System Extension. In: Trends in Artificial Intelligence, pp. 48 - 57 (Eds. Ardizzone, E.; Gaglio, S.; Sorbello, F.). 2nd Congress of the Italian Association for Artificial Intelligence, Palermo, Italy, October 29, 1991 - October 31, 1991. Springer, Berlin (1991)
22.
Conference Paper
Some Normalization Properties of Martin-Löf's Type Theory, and Applications. In: Theoretical Aspects of Computer Software, pp. 475 - 494 (Eds. Ito, T.; Meyer, A. R.). International Conference on Theoretical Aspects of Computer Software, Sendaj, Japan, September 24, 1991 - September 27, 1991. Springer, Berlin (1991)
23.
Conference Paper
Fast and Reliable Parallel Hashing. In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), pp. 50 - 61. Untitled Event, Hilton Head Island, South Carolina, USA, July 21, 2001 - July 25, 2001. ACM, New York, NY, USA (1991)
24.
Conference Paper
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), pp. 103 - 120 (Eds. Abramsky, S.; Maibaum, T. S. E.). Untitled Event, Brighton, UK, 1991. Springer, Berlin, Germany (1991)
25.
Conference Paper
Towards the MEDLAR Framework. In: ESPRIT '91 Conference Proceedings, pp. 822 - 841. Commission of the European Communities, Brussels, Belgium (1991)
26.
Conference Paper
Dynamic Scheduling on Parallel Machines. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pp. 111 - 120. 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 01, 1991 - October 04, 1991. IEEE Computer Society, Los Alamitos, CA (1991)
27.
Conference Paper
A Time-Randomness Tradeoff for Communication Complexity. In: Distributed Algorithms, 4th International Workshop, pp. 390 - 401. Untitled Event, Bari, Italy, September 24, 1990. Springer, Berlin, Germany (1991)
28.
Conference Paper
Efficient Implementation of Narrowing and Rewriting. In: Processing Declarative Knowledge, p. 344‒365 (Eds. Boley, H.; Richter, M.M.). Intern. Workshop on Processing Declarative Knowledge, Kaiserslautern, Germany, July 01, 1991 - July 03, 1991. Springer, Berlin (1991)
29.
Conference Paper
Parametric Order‐sorted Types in Logic Programming. In: TAPSOFT‐91, p. 181‒200 (Eds. Abramsky, S.; Maibaum, T.S.E.). International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 08, 1991 - April 12, 1991. Springer, Berlin (1991)
30.
Conference Paper
Detecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test. In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA '91), pp. 74 - 85 (Ed. Book, R.). Untitled Event, Como, Italy, 1991. Springer, Berlin, Germany (1991)
31.
Conference Paper
An optimal construction method for generalized convex layers. In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, pp. 349 - 363 (Eds. Hsu, W.L.; Lee, R.C.T.). Untitled Event, Taipei, Republic of China, December 16, 1991 - December 18, 1991. Springer, Berlin, Germany (1991)
32.
Conference Paper
Parameter Structures for Parametrized Modal Operators. In: Proc. Intern. Joint Conference on Artificial Intelligence (IJCAI'91), pp. 512 - 517 (Eds. Mylopoulos, J.; Reiter, R.). 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, August 24, 1991 - August 30, 1991. Morgan Kaufmann, San Mateo, CA (1991)
33.
Conference Paper
The Markgraf Karl Refutation Procedure. In: Computational Logic, Essays in Honor of Alan Robinson, pp. 41 - 112 (Eds. Lassez, J. L.; Plotkin, G.). MIT Press, Cambridge, Mass. (1991)
34.
Conference Paper
Compatibility of Order-sorted Rewrite Rules. In: Conditional and Typed Rewriting Systems, pp. 407 - 416 (Eds. Kaplan, S.; Okada, M.). Second International CTRS Workshop, Montreal, Canada, June 11, 1990 - June 14, 1990. Springer, Berlin (1991)
Thesis - Master (1)
35.
Thesis - Master
Transformation in dichten Wäldern. Master, Universität des Saarlandes, Saarbrücken (1991)
Report (27)
36.
Report
Associative-commutative reduction orderings. Max-Planck-Institut für Informatik, Saarbrücken (1991), 7 pp.
37.
Report
Rewrite-based equational theorem proving with selection and simplification. Max-Planck-Institut für Informatik, Saarbrücken (1991), 24 pp.
38.
Report
Logic programming with pseudo-Boolean constraints. Max-Planck-Institut für Informatik, Saarbrücken (1991), 20 pp.
39.
Report
An o(n³)-time maximum-flow algorithm. Max-Planck-Institut für Informatik, Saarbrücken (1991), 30 pp.
40.
Report
A lower bound for the nondeterministic space complexity of contextfree recognition. Max-Planck-Institut für Informatik, Saarbrücken (1991), 4 pp.