Scientific Publications

Alt, H.; Mehlhorn, K.: A Language over a One Symbol Alphabet Requiring only O(log log n) Space. SIGACT News 7, pp. 31 - 33 (1975)

Mehlhorn, K.: Nearly Optimal Binary Search Trees. Acta Informatica 5, pp. 287 - 295 (1975)

Mehlhorn, K.: Best possible bounds for the weighted path length of optimum binary search trees. In: Automata Theory and Formal Languages, 2nd GI Conference, pp. 31 - 41. Untitled Event, Kaiserslautern, Germany, May 20, 1975. Springer, Berlin, Germany (1975)

Mehlhorn, K.; Galil, Z.: Monotone Switching Circuits and Boolean Matrix Product. In: Mathematical foundations of computer science (MFCS-75): 4th symposium, pp. 315 - 319. Untitled Event, Mariánské Lázne, Czechoslovakia, September 01, 1975. Springer, Berlin, Germany (1975)

Alt, H.; Mehlhorn, K.: Untere Schranken für den Platzbedarf bei der kontext-freien Analyse. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1975)

Mehlhorn, K.: Bracket-Languages are Recognizable in Logarithmic Space. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1975)

Mehlhorn, K.: A game on graphs, (1975)