Becker, M.; Degenhardt, W.; Doenhardt, J.; Hertel, S.; Kaninke, G.; Kerber, W.; Mehlhorn, K.; Näher, S.; Rohnert, H.; Winter, T.: A Probabilistic Algorithm for Vertex Connectivity of Graphs. Information Processing Letters 15 (3), pp. 135 - 136 (1982)

Eisenbarth, B.; Ziviani, N.; Gonnet, G. H.; Mehlhorn, K.; Wood, D.: The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees. Information and Control 55 (1-3), pp. 125 - 174 (1982)

Huddleston, S.; Mehlhorn, K.: A New Data Structure for Representing Sorted Lists. Acta Informatica 17, pp. 157 - 184 (1982)

Mehlhorn, K.: A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions. SIAM Journal on Computing 11 (4), pp. 748 - 760 (1982)

Lengauer, T.; Mehlhorn, K.: On the Complexity of VLSI-Computations. VLSI Systems and Computations ??, pp. 89 - 99 (1981)

Mehlhorn, K.: Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures. Mathematical Systems Theory 15 (1), pp. 1 - 16 (1981)

Mehlhorn, K.: Arbitrary Weight Changes in Dynamic Trees. Revue Française d'Automatique, d'Informatique et de Recherche Opérationnelle: RAIRO 15 (3), pp. 183 - 211 (1981)

Mehlhorn, K.; Overmars, M. H.: Optimal Dynamization of Decomposable Searching Problems. Information Processing Letters 12 (2), pp. 93 - 98 (1981)

Altenkamp, D.; Mehlhorn, K.: Codes: Unequal Probabilities, Unequal Letter Cost. Journal of the ACM 27 (3), pp. 412 - 427 (1980)

Blum, N.; Mehlhorn, K.: On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theoretical Computer Science 11 (3), pp. 303 - 320 (1980)

Güttler, R.; Mehlhorn, K.; Schneider, W.: Binary Search Trees: Average and Worst Case Behavior. Elektronische Informationsverarbeitung und Kybernetik 16 (1-3), pp. 41 - 61 (1980)

Mehlhorn, K.: An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes. IEEE Transactions on Information Theory 26 (5), pp. 513 - 517 (1980)

Alt, H.; Mehlhorn, K.: Complexity Arguments in Algebraic Language Theory. Revue Française d'Automatique, d'Informatique et de Recherche Opérationnelle: RAIRO / Association Française pour la Cybernétique Economique et Technique 13 (3), pp. 217 - 225 (1979)

Mehlhorn, K.: Dynamic Binary Search. SIAM Journal on Computing 8 (2), pp. 175 - 198 (1979)

Mehlhorn, K.: Parsing Macro Grammars Top Down. Information and Control 40 (2), pp. 123 - 143 (1979)

Mehlhorn, K.: Some Remarks on Boolean Sums. Acta Informatica 12, pp. 371 - 375 (1979)

Mehlhorn, K.: Dynamic Data Structures. Mathematical Centre Tracts 108, pp. 71 - 96 (1979)

Mehlhorn, K.; Tsagarakis, M.: On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs. Colloque de Lille 'les Arbres en Algebre et en Programmation' ?? (1979)

Mehlhorn, K.: Effiziente Algorithmen: Ein Beispiel. Informatik-Spektrum 1, pp. 81 - 89 (1978)

Deussen, P.; Mehlhorn, K.: Van Wijngaarden Grammars and Space Complexity Class EXSPACE. Acta Informatica 8, pp. 193 - 199 (1977)