Wissenschaftliche Publikationen

Alt, H.; Blum, N.; Mehlhorn, K.; Paul, M.: Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n^1.5 sqrt(m/log n)). Information Processing Letters 37 (4), S. 237 - 240 (1991)

Basin, D. A.; Brown, G. M.; Leeser, M. E.: Formally Verified Synthesis of Combinational CMOS Circuits. Integration: The Intern. Journal of VLSI Design 11 (3), S. 235 - 250 (1991)

Bhatt, P. C. P.; Diks, K.; Hagerup, T.; Prasad, V. C.; Radzik, T.; Saxena, S.: Improved Deterministic Parallel Integer Sorting. Information and Computation 94 (1), S. 29 - 47 (1991)

Bockmayr, A.; Brzoska, C.; Deussen, P.; Varsek, I.: KA-Prolog: Erweiterungen einer logischen Programmiersprache und ihre effiziente Implementierung. Informatik - Forschung und Entwicklung 6, S. 128 - 140 (1991)

Brink, C.; Rewitzky, I. M.; Schmidt, R. A.: Autodescriptivity: Beware! The Computer Journal 34 (4), S. 380 - 381 (1991)

Eisinger, N.; Ohlbach, H. J.; Präcklein, A.: Reduction Rules for Resolution-based Systems. Artificial Intelligence 50 (2), S. 141 - 181 (1991)

Fong, P.; Seidel, H.-P.: Control Points for Multivariate B-Spline Surfaces over Arbitrary Triangulations. Computer Graphics Forum 10 (4), S. 309 - 317 (1991)

Ganzinger, H.: Order-sorted Completion: The Many-sorted Way. Theoretical computer science 89, S. 3 - 32 (1991)

Ganzinger, H.: A Completion Procedure for Conditional Equations. Journal of Symbolic Computation 11 (1-2), S. 51 - 81 (1991)

Hanus, M.: Horn Clause Programs with Polymorphic Types: Semantics and Resolution. Theoretical Computer Science 89 (1), S. 63 - 106 (1991)

Mehlhorn, K.; Meiser, S.; Ó'Dúnlaing, C.: On the construction of abstract Voronoi diagrams. Discrete & Computational Geometry 6, S. 211 - 224 (1991)

Mehlhorn, K.; Yap, C.-K.: Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM Journal on Computing 20 (4), S. 603 - 621 (1991)

Ohlbach, H. J.: Semantics Based Translation Methods for Modal Logics. Journal of Logic and Computation 1 (5), S. 691 - 746 (1991)

Seidel, H.-P.: Computing B-spline Control Points Using Polar Forms. Computer Aided Design 23 (9), S. 634 - 640 (1991)

Seidel, H.-P.: On Hermite Interpolation with B-splines. Computer Aided Geometric Design 8 (6), S. 439 - 441 (1991)

Basin, D.; Kaufmann, M.: The Boyer-Moore Prover and Nuprl: An Experimental Comparison. In: Logical Frameworks, S. 90 - 119 (Hg. Huet, G.; Plotkin, G.). Cambridge University Press, Cambridge (1991)

Seidel, H.-P.: Universal Splines and Geometric Continuity. In: Curves and Surfaces, S. 437 - 444 (Hg. Laurent, P.-}.; Le Méhauté, A.; Schumaker, L. L.). Academic Press, San Diego, CA (1991)

Mehlhorn, K.; Trajan, R. E. (Hg.): Effiziente Algorithmen. Workshop Effiziente Algorithmen, Oberwolfach, Germany, 04. August 1991 - 10. August 1991. Mathematisches Forschungsinstitut, Oberwolfach, Germany (1991), 16 S.

Bachmair, L.; Ganzinger, H.: Completion of First-order Clauses with Equality by Strict Superposition. In: Conditional and Typed Rewriting Systems, S. 162 - 180 (Hg. Kaplan, S.; Okada, M.). International Workshop on Conditional and Typed Rewriting, Montreal, Canada. Springer, Berlin (1991)

Bachmair, L.; Ganzinger, H.: Perfect Model Semantics for Logic Programs with Equality. In: Logic Programming, S. 645 - 659. Eigth International Conference on Logic Programming, Paris, 24. Juli 1991 - 28. Juli 1991. MIT Press, Cambridge, Mass. (1991)