Scientific Publications

Journal Article (4)

1.
Journal Article
Altenkamp, D.; Mehlhorn, K.: Codes: Unequal Probabilities, Unequal Letter Cost. Journal of the ACM 27 (3), pp. 412 - 427 (1980)
2.
Journal Article
Blum, N.; Mehlhorn, K.: On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theoretical Computer Science 11 (3), pp. 303 - 320 (1980)
3.
Journal Article
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)
4.
Journal Article
Mehlhorn, K.: An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes. IEEE Transactions on Information Theory 26 (5), pp. 513 - 517 (1980)

Conference Paper (2)

5.
Conference Paper
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)
6.
Conference Paper
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)

Report (1)

7.
Report
Mehlhorn, K.: Lower bounds on the efficiency of transforming static data structures into dynamic structures. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1980)

Other (1)

8.
Other
Mehlhorn, K.; Overmars, M. H.: Optimal dynamization of decomposable searching problems, (1980)
Go to Editor View