Mehlhorn, K.: Balanced Trees as a Datastructure for Representing Sorted Lists. In: Colloquium Complexiteit en Algoritmen, pp. 69 - 91 (Eds. Vitányi, P. M. B.; van Leeuwen, J.; van Emde Boas, P.). Colloquium Complexiteit en Algoritmen, Amsterdam, The Netherlands, 1982. Mathematisch Centrum, Amsterdam (1982)

Mehlhorn, K.; Schmidt, E. M.: Las Vegas Is better than Determinism in VLSI and Distributed Computing. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 330 - 337. Untitled Event, San Francisco, California, USA, May 05, 1982. ACM, Baltimore, MD, USA (1982)

Alt, H.; Mehlhorn, K.; Munro, J. I.: Partial Match Retrieval in Implicit Data Structures. In: Mathematical foundations of computer science (MFCS-81): 10th symposium, ,, pp. 156 - 161. Untitled Event, Strbské Pleso, Czechoslovakia, August 31, 1981. Springer, Berlin, Germany (1981)

Hong, J.-W.; Mehlhorn, K.; Rosenberg, A. L.: Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). In: Automata, languages and programming (ICALP-81): 8th international colloquium, pp. 41 - 55. Untitled Event, Acre (Akko), Israel, July 13, 1981. Springer, Berlin, Germany (1981)

Huddleston, S.; Mehlhorn, K.: Robust balancing in B-trees. In: Theoretical computer science: 5th GI-conference, pp. 234 - 244. Untitled Event, Karlsruhe, Germany, March 23, 1981. Springer, Berlin, Germany (1981)

Mehlhorn, K.: Pebbling Mountain Ranges and its Application of DCFL-Recognition. In: Automata, languages and programming (ICALP-80): 7th annual international colloquium, pp. 422 - 435. Untitled Event, Noordwijkerhout, The Netherlands, July 14, 1980. Springer, Berlin, Germany (1980)

Mehlhorn, K.: A New Data Structure for Representing Sorted Lists. In: Graph-theoretic concepts in computer science (WG-80): 6th international workshop, pp. 90 - 112. Untitled Event, Bad Honnef/Bonn, Germany, June 15, 1980. Springer, Berlin, Germany (1980)

Blum, N.; Mehlhorn, K.: Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. In: Theoretical Computer Science, pp. 67 - 78 (Ed. Weihrauch, K.). GI-Fachtagung Theoretische Informatik, Aachen, Germany, March 26, 1979 - March 28, 1979. Springer, Berlin, Germany (1979)

Ganzinger, H.: On Storage Optimization for Automatically Generated Compilers. In: Theoretical Computer Science, pp. 132 - 141 (Ed. Weihrauch, K.). 4. GI-Fachtagung Theoretische Informatik, Aachen, Germany, March 26, 1979 - March 28, 1979. Springer, Berlin, Germany (1979)

Mehlhorn, K.: Sorting Presorted Files. In: Theoretical Computer Science, pp. 199 - 212 (Ed. Weihrauch, K.). 4. GI-Fachtagung Theoretische Informatik, Aachen, Germany, March 26, 1979 - March 28, 1979. Springer, Berlin, Germany (1979)

Mehlhorn, K.: Searching, Sorting and Information Theory. In: Mathematical Foundations of Computer Science 1979, pp. 131 - 145 (Ed. Bečvář, J.). 8th Symposium on Mathematical Foundations of Computer Science, Olomouc, Czechoslovakia, September 03, 1979 - September 07, 1979. Springer, Berlin, Germany (1979)

Mehlhorn, K.: Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens. In: GI - 9. Jahrestagung, pp. 16 - 22 (Eds. Böhling, K. H.; Spies, P. P.). GI - 9. Jahrestagung, Bonn, Germany, October 01, 1979 - October 05, 1979. Springer, Berlin, Germany (1979)

Mehlhorn, K.: Some Remarks on Boolean Sums. In: Mathematical foundations of computer science (MFCS-79): 8th symposium, pp. 375 - 380. Untitled Event, Olomouc, Czechoslovakia, September 03, 1979. Springer, Berlin, Germany (1979)

Altenkamp, D.; Mehlhorn, K.: Codes: Unequal Probabilities, Unequal Letter Cost. In: Automata, languages and programming (ICALP-78): 5th international colloquium, pp. 15 - 25. Untitled Event, Udine, Italy, July 17, 1978. Springer, Berlin, Germany (1978)

Mehlhorn, K.: Dynamic Binary Search. In: Automata, Languages and Programming: Fourth Colloquium (ICALP-77), pp. 323 - 336. Untitled Event, Turku, Finland, July 18, 1977. Springer, Berlin, Germany (1977)

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)

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)