Scientific Publications

Alt, H.; Hagerup, T.; Mehlhorn, K.; Preparata, F. P.: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM Journal on Computing 16 (5), pp. 808 - 835 (1987)

Fries, O.; Mehlhorn, K.; Näher, S.; Tsakalidis, A.: A log log n Data Structure for Three-sided Range Queries. Information Processing Letters 25 (4), pp. 269 - 273 (1987)

Hagerup, T.: Towards Optimal Parallel Bucket Sorting. Information and Computation 75 (1), pp. 39 - 51 (1987)

Mehlhorn, K.; Preparata, F. P.: Area-Time Optimal Division for T=Omega((log n)^1+epsilon). Information and Computation 72 (3), pp. 270 - 282 (1987)

Albrecht, A.; Jung, H.; Mehlhorn, K. (Eds.): Parallel Algorithms and Architectures (Lecture Notes in Computer Science, 269). International Workshop on Parallel Algorithms and Architectures, Suhl, FRG, May 27, 1987 - May 30, 1987. Springer, Berlin (1987), 205 pp.

Mehlhorn, K. (Ed.): Workshop über Komplexitätstheorie, Effiziente Algorithmen und Datenstrukturen (Interner Bericht / Fachbereich Informatik, 87,4). Workshop über Komplexitätstheorie, Effiziente Algorithmen und Datenstrukturen, Frankfurt, Main, Germany, February 03, 1987. Johann Wolfgang Goethe-Universität, Frankfurt/Main (1987), 10 pp.

Alt, H.; Hagerup, T.; Mehlhorn, K.; Preparata, F. P.: Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. In: Parallel Algorithms and Architectures, pp. 11 - 15. International Workshop on Parallel Algorithms and Architectures, Suhl, FRG, May 25, 1987. Springer, Berlin (1987)

Alt, H.; Mehlhorn, K.; Wagener, H.; Welzl, E.: Convergence, Similarity and Symmetries of Geometric Objects. In: Computational geometry (SCG-87): 3rd symposium, pp. 308 - 315. Untitled Event, Waterloo, Canada, June 08, 1987. ACM, New York, USA (1987)

Kaufmann, M.; Mehlhorn, K.: On Local Routing of Two-Terminal Nets. In: STACS 87, pp. 40 - 52 (Eds. Brandenburg, F. J.; Vidal-Naquet, G.; Wirsing, M.). 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19, 1987 - February 21, 1987. Springer, Berlin, Germany (1987)

Mehlhorn, K.; Näher, S.; Alt, H.: A Lower Bound for the Complexity of the Union-Split-Find Problem. In: Automata, Languages and Programming (ICALP-87): 14th International Colloquium, pp. 479 - 488. Untitled Event, Karlsruhe, Federal Republic of Germany, July 13, 1987. Springer, Berlin, Germany (1987)

Alt, H.; Mehlhorn, K.; Wagener, H.; Welzl, E.: Congruence, Similarity and Symmetries of Geometric Objects. Universität des Saarlandes / Fachbereich Informatik, Saarbrücken (1987)

Jung, H.; Mehlhorn, K.: Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees. SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken (1987)

Mehlhorn, K.; Näher, S.: A Faster Compaction Algorithm with Automatic Jog Insertion. Fachbereich 10, Informatik, Universität des Saarlandes, Saarbrücken (1987)

Mehlhorn, K.: A Faster Approximation Algorithm for the Steiner Problem in Graphs, (1987)