Wissenschaftliche Publikationen

Alt, H.; Mehlhorn, K.; Munro, J. I.: Partial Match Retrieval in Implicit Data Structures. Information Processing Letters 19 (2), S. 61 - 65 (1984)

Alt, H.; Mehlhorn, K.; Munro, J.: On the complexity of partial match retrieval. Information Processing Letters 19, S. 61 - 65 (1984)

Hertel, S.; Mäntylä, M.; Mehlhorn, K.; Nievergelt, J.: Space Sweep Solves Intersection of Convex Polyhedra. Acta Informatica 21, S. 501 - 519 (1984)

Hoffmann, K.; Mehlhorn, K.: Intersecting a line and a simple polygon. Eatcs Bulletin 22, S. 120 - 121 (1984)

Lengauer, T.; Mehlhorn, K.: Four Results on the Complexity of VLSI Computation. Advances in Computing Research 2, S. 1 - 22 (1984)

Mehlhorn, K.: AT²-optimal VLSI for Integer Division and Integer Square Rooting. Integration, the VLSI Journal 2 (2), S. 163 - 167 (1984)

Mehlhorn, K.; Vishkin, U.: Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Informatica 21, S. 339 - 374 (1984)

Brauer, W.; Rozenberg, G.; Salomaa, A. (Hg.): Data structures and algorithms. Volume 1: Sorting and searching. Springer, Berlin, Germany (1984), 336 S.

Brauer, W.; Rozenberg, G.; Salomaa, A. (Hg.): Data structures and algorithms. Volume 2: Graph algorithms and NP-completeness. Springer, Berlin, Germany (1984), 260 S.

Brauer, W.; Rozenberg, G.; Salomaa, A. (Hg.): Data structures and algorithms. Volume 3: Multi-dimensional searching and computational geometry. Springer, Berlin, Germany (1984), 284 S.

Fontet, M.; Mehlhorn, K. (Hg.): STACS 84 (Lecture Notes in Computer Science, 166). STACS 1984, Paris, 11. April 1984 - 13. April 1984. Springer, Berlin (1984)

Lengauer, T.; Mehlhorn, K.: The HILL system: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts. In: Conference on Advanced Research in VLSI, S. 139 - 149 (Hg. Penfield, P.). 6th Conference on Advanced Research in VLSI, Cambridge, MA, USA, 23. Januar 1984 - 25. Januar 1984. Artech House, Dedham, Mass., USA (1984)

Mehlhorn, K.: Über Verdrahtungsalgorithmen. In: GI Jahrestagung (Fachgespräche), S. 79 - 89. Untitled Event, Braunschweig, Germany, 01. Oktober 1984. Springer, Berlin, Germany (1984)

Mehlhorn, K.: On Optimal VLSI-Circuits for the Basic Arithmetic Functions. In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), S. 23 - 30. Untitled Event, Bordeaux, France, 05. März 1984. Cambridge University Press, Cambridge, UK (1984)

Mehlhorn, K.; Preparata, F. P.: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. In: Automata, languages and programming (ICALP-84): 11th colloquium, S. 347 - 357. Untitled Event, Antwerp, Belgium, 16. Juli 1984. Springer, Berlin, Germany (1984)

Hoffmann, K.; Mehlhorn, K.; Rosenstiehl, P.; Tarjan, R. E.: Sorting Jordan Sequences in Linear Time. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1984)

Kaufmann, M.; Mehlhorn, K.: Local Routing of Two-terminal Nets is Easy. Universität des Saarlandes / Fachbereich Informatik, Saarbrücken (1984)

Becker, M.; Mehlhorn, K.: Algorithms for routing in planar graphs, (1984)

Kaufmann, M.; Mehlhorn, K.: Routing through a generalized switchbox, (1984)

Mehlhorn, K.: Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof, (1984)