Mehlhorn, K.; Schmidt, B. H.: A Single Shortest Path Algorithm for Graphs with Separators. In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), S. 302 - 309. Untitled Event, Borgholm, Sweden, 21. August 1983. Springer, Berlin, Germany (1983)

Mehlhorn, K.: On the Program Size of Perfect and Universal Hash Functions. In: Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science, S. 170 - 175. 23th Annual IEEE Symposium on Foundations of Computer Science, Chicago, IL, USA, 03. November 1982 - 05. November 1982. IEEE, New York, NY, USA (1982)

Mehlhorn, K.: Balanced Trees as a Datastructure for Representing Sorted Lists. In: Colloquium Complexiteit en Algoritmen, S. 69 - 91 (Hg. 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), S. 330 - 337. Untitled Event, San Francisco, California, USA, 05. Mai 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, ,, S. 156 - 161. Untitled Event, Strbské Pleso, Czechoslovakia, 31. August 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, S. 41 - 55. Untitled Event, Acre (Akko), Israel, 13. Juli 1981. Springer, Berlin, Germany (1981)

Huddleston, S.; Mehlhorn, K.: Robust balancing in B-trees. In: Theoretical computer science: 5th GI-conference, S. 234 - 244. Untitled Event, Karlsruhe, Germany, 23. März 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, S. 422 - 435. Untitled Event, Noordwijkerhout, The Netherlands, 14. Juli 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, S. 90 - 112. Untitled Event, Bad Honnef/Bonn, Germany, 15. Juni 1980. Springer, Berlin, Germany (1980)

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

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

Mehlhorn, K.: Sorting Presorted Files. In: Theoretical Computer Science, S. 199 - 212 (Hg. Weihrauch, K.). 4. GI-Fachtagung Theoretische Informatik, Aachen, Germany, 26. März 1979 - 28. März 1979. Springer, Berlin, Germany (1979)

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

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

Mehlhorn, K.: Some Remarks on Boolean Sums. In: Mathematical foundations of computer science (MFCS-79): 8th symposium, S. 375 - 380. Untitled Event, Olomouc, Czechoslovakia, 03. September 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, S. 15 - 25. Untitled Event, Udine, Italy, 17. Juli 1978. Springer, Berlin, Germany (1978)

Mehlhorn, K.: Dynamic Binary Search. In: Automata, Languages and Programming: Fourth Colloquium (ICALP-77), S. 323 - 336. Untitled Event, Turku, Finland, 18. Juli 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, S. 338 - 354. Untitled Event, Edinburgh, UK, 20. Juli 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, S. 301 - 313. Untitled Event, Stuttgart, Germany, 29. September 1976. Springer, Berlin, Germany (1976)

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