Wissenschaftliche Publikationen

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

Mehlhorn, K.: Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures. Mathematical Systems Theory 15 (1), S. 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), S. 183 - 211 (1981)

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

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)