Wissenschaftliche Publikationen

Becker, M.; Mehlhorn, K.: Algorithms for Routing in Planar Graphs. Acta Informatica 23 (2), S. 163 - 176 (1986)

Hoffmann, K.; Mehlhorn, K.; Rosenstiehl, P.; Tarjan, R. E.: Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees. Information and Control 68 (1-3), S. 170 - 184 (1986)

Kaufmann, M.; Mehlhorn, K.: Routing through a Generalized Switchbox. Journal of Algorithms 7 (4), S. 510 - 531 (1986)

Mehlhorn, K.: Über Verdrahtungsalgorithmen. Informatik Spektrum 9 (4), S. 227 - 234 (1986)

Mehlhorn, K.; Preparata, F. P.: Routing through a Rectangle. Journal of the ACM 33 (1), S. 60 - 85 (1986)

Mehlhorn, K.; Preparata, F. P.; Sarrafzadeh, M.: Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica 1 (2), S. 213 - 221 (1986)

Mehlhorn, K.; Schmidt, B. H.: On BF-orderable Graphs. Discrete applied mathematics 15 (2-3), S. 315 - 327 (1986)

Mehlhorn, K.; Tsakalidis, A. K.: An Amortized Analysis of Insertions into AVL-Trees. SIAM Journal on Computing 15 (1), S. 22 - 33 (1986)

Loeckx, J.; Mehlhorn, K.; Wilhelm, R.: Grundlagen der Programmiersprachen. Teubner, Stuttgart, Germany (1986), 448 S.

Mehlhorn, K.: Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen. Teubner, Stuttgart, Germany (1986), 314 S.

Lengauer, T.; Mehlhorn, K.: VLSI complexity, efficient VLSI algorithms and the HILL design system. In: Algorithmics for VLSI, S. 33 - 89 (Hg. Trullemans, C.). Academic Press, London ; Orlando (1986)

Makedon, F.; Mehlhorn, K.; Papatheodorou, T. S.; Spirakis, P. G. (Hg.): VLSI Algorithms and Architectures (Lecture Notes in Computer Science, 227). Aegean Workshop on Computing 1986, Loutraki, Greece, 08. Juli 1986 - 11. Juli 1986. Springer, Berlin (1986), 328 S.

Alt, H.; Hagerup, T.; Mehlhorn, K.; Preparata, F. P.: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), S. 199 - 208. Untitled Event, Bratislava, Czechoslovakia, 25. August 1986. Springer, Berlin, Germany (1986)

Fürer, M.; Mehlhorn, K.: AT$^2$-Optimal Galois Field Multiplier for VLSI. In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, S. 217 - 225. Untitled Event, Loutraki, Greece, 08. Juli 1986. Springer, Berlin, Germany (1986)

Mehlhorn, K.; Preparata, F. P.: Area-time Optimal Division for T=Omega(log n)$^1+epsilon$". In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, S. 341 - 352. Untitled Event, Orsay, France, 16. Januar 1986. Springer, Berlin, Germany (1986)

Kaufmann, M.; Mehlhorn, K.: On Local Routing of Two-Terminal Nets. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1986)

Mehlhorn, K.; Näher, S.: Dynamic fractional cascading. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1986)

Mehlhorn, K.; Näher, S.; Alt, H.: A Lower Bound for the Complexity of the Union-Split-Find Problem, (1986)