Scientific Publications

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)

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, pp. 170 - 175. 23th Annual IEEE Symposium on Foundations of Computer Science, Chicago, IL, USA, November 03, 1982 - November 05, 1982. IEEE, New York, NY, USA (1982)

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)

Hong, J.-W.; Mehlhorn, K.: Cost tradeoffs in graph embeddings, with applications, (1982)