Seidel, H.-P.: An Introduction to Polar Forms. IEEE Computer Graphics and Applications 13 (1), S. 38 - 46 (1993)

Seidel, H.-P.: Polar Forms for Geometrically Continuous Spline Curves of Arbitrary Degree. ACM Transactions on Graphics 12 (1), S. 1 - 34 (1993)

Alt, H.; Fleischer, R.; Kaufmann, M.; Mehlhorn, K.; Näher, S.; Schirra, S.; Uhrig, C.: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8 (5-6), S. 391 - 408 (1992)

Alt, H.; Geffert, V.; Mehlhorn, K.: A Lower Bound for the Nondeterministic Space Complexity of Context-free Recognition. Information Processing Letters 42 (1), S. 25 - 27 (1992)

Brink, C.; Schmidt, R. A.: Subsumption Computed Algebraically. Computers & Mathematics with Applications 23 (2-5), S. 329 - 342 (1992)

Dubhashi, D. P.: On decidable varieties of Heyting algebras. Journal of Symbolic Logic 57 (3), S. 988 - 991 (1992)

Fleischer, R.; Mehlhorn, K.; Rote, G.; Welzl, E.; Yap, C.-K.: Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8 (5-6), S. 365 - 389 (1992)

Gabbay, D. M.; Ohlbach, H. J.: Quantifier Elimination in Second-Order Predicate Logic. South African Computer Journal 7, S. 35 - 43 (1992)

Hagerup, T.: On a Compaction Theorem of Ragde. Information Processing Letters 43 (6), S. 335 - 340 (1992)

Hagerup, T.; Schmitt, A.; Seidl, H.: FORK: A High-level Language for PRAMs. Future Generation Computer Systems 8 (4), S. 379 - 393 (1992)

Kaufmann, M.; Mehlhorn, K.: On Local Routing of Two-terminal Nets. Journal of Combinatorial Theory. Series B 55 (1), S. 33 - 72 (1992)

Mehlhorn, K.; Paul, W. J.; Uhrig, C.: k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs. Information and Computation 101 (1), S. 123 - 129 (1992)

Ohlbach, H. J.: Logic Engineering: Konstruktion von Logiken. KI 3, S. 34 - 38 (1992)

Smid, M.: Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. Discrete & Computational Geometry 7, S. 415 - 431 (1992)

Waldmann, U.: Semantics of Order-Sorted Specifications. Theoretical Computer Science 94 (1), S. 1 - 35 (1992)

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)