Scientific Publications

Mehlhorn, K.: An Improved Lower Bound on the Formula Complexity of Context-Free Recognition. Elektronische Informationsverarbeitung und Kybernetik 12, pp. 523 - 524 (1976)

Mehlhorn, K.: Polynomial and abstract subrecursive classes. Journal of Computer and System Sciences 12, pp. 147 - 178 (1976)

Mehlhorn, K.: Bracket-languages are recognizable in logarithmic space. Information Processing Letters 5, pp. 168 - 170 (1976)

Mehlhorn, K.; Galil, Z.: Monotone Switching Circuits and Boolean Matrix Product. Computing 16, pp. 99 - 111 (1976)

Alt, H.; Mehlhorn, K.: Lower Bounds for the Space Complexity of Context-Free Recognition. In: Third International Colloquium on Automata, Languages and Programming, pp. 338 - 354. Untitled Event, Edinburgh, UK, July 20, 1976. Edinburgh University Press, Edinburgh, UK (1976)

Güttler, R.; Mehlhorn, K.; Schneider, W.; Wernet, N.: Binary Search Trees: Average and Worst Case Behavior. In: GI - 6. Jahrestagung, pp. 301 - 313. Untitled Event, Stuttgart, Germany, September 29, 1976. Springer, Berlin, Germany (1976)

Heydthausen, M.; Mehlhorn, K.: Top Down Parsing of Macro Grammars. In: GI - 6. Jahrestagung, pp. 95 - 108. Untitled Event, Stuttgart, Germany, September 29, 1976. Springer, Berlin, Germany (1976)

Güttler, R.; Mehlhorn, K.; Schneider, W.: Binary Search Trees: Average and Worst Case Behavior. Fachbereich Informatik, Universiät des Saarlandes, Saarbrücken (1976)

Heydthausen, M.; Mehlhorn, K.: Top down parsing of macro grammars (preliminary report). Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1976)

Mehlhorn, K.: Dynamic Binary Search. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1976)

Mehlhorn, K.: An improved lower bound on the formula complexity of context-free recognition. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1976)

Mehlhorn, K.: Dynamic Binary Search Trees: Extended Abstracts. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1976)

Mehlhorn, K.: An O(n log n) lower bound for the synchronous circuit size of integer multiplication, (1976)