Mehlhorn, K.: A New Data Structure for Representing Sorted Lists. In: Graph-theoretic concepts in computer science (WG-80): 6th international workshop, S. 90 - 112. Untitled Event, Bad Honnef/Bonn, Germany, 15. Juni 1980. Springer, Berlin, Germany (1980)

Blum, N.; Mehlhorn, K.: Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. In: Theoretical Computer Science, S. 67 - 78 (Hg. Weihrauch, K.). GI-Fachtagung Theoretische Informatik, Aachen, Germany, 26. März 1979 - 28. März 1979. Springer, Berlin, Germany (1979)

Ganzinger, H.: On Storage Optimization for Automatically Generated Compilers. In: Theoretical Computer Science, S. 132 - 141 (Hg. Weihrauch, K.). 4. GI-Fachtagung Theoretische Informatik, Aachen, Germany, 26. März 1979 - 28. März 1979. Springer, Berlin, Germany (1979)

Mehlhorn, K.: Sorting Presorted Files. In: Theoretical Computer Science, S. 199 - 212 (Hg. Weihrauch, K.). 4. GI-Fachtagung Theoretische Informatik, Aachen, Germany, 26. März 1979 - 28. März 1979. Springer, Berlin, Germany (1979)

Mehlhorn, K.: Searching, Sorting and Information Theory. In: Mathematical Foundations of Computer Science 1979, S. 131 - 145 (Hg. Bečvář, J.). 8th Symposium on Mathematical Foundations of Computer Science, Olomouc, Czechoslovakia, 03. September 1979 - 07. September 1979. Springer, Berlin, Germany (1979)

Mehlhorn, K.: Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens. In: GI - 9. Jahrestagung, S. 16 - 22 (Hg. Böhling, K. H.; Spies, P. P.). GI - 9. Jahrestagung, Bonn, Germany, 01. Oktober 1979 - 05. Oktober 1979. Springer, Berlin, Germany (1979)

Mehlhorn, K.: Some Remarks on Boolean Sums. In: Mathematical foundations of computer science (MFCS-79): 8th symposium, S. 375 - 380. Untitled Event, Olomouc, Czechoslovakia, 03. September 1979. Springer, Berlin, Germany (1979)

Altenkamp, D.; Mehlhorn, K.: Codes: Unequal Probabilities, Unequal Letter Cost. In: Automata, languages and programming (ICALP-78): 5th international colloquium, S. 15 - 25. Untitled Event, Udine, Italy, 17. Juli 1978. Springer, Berlin, Germany (1978)

Mehlhorn, K.: Dynamic Binary Search. In: Automata, Languages and Programming: Fourth Colloquium (ICALP-77), S. 323 - 336. Untitled Event, Turku, Finland, 18. Juli 1977. Springer, Berlin, Germany (1977)

Alt, H.; Mehlhorn, K.: Lower Bounds for the Space Complexity of Context-Free Recognition. In: Third International Colloquium on Automata, Languages and Programming, S. 338 - 354. Untitled Event, Edinburgh, UK, 20. Juli 1976. Edinburgh University Press, Edinburgh, UK (1976)

Güttler, R.; Mehlhorn, K.; Schneider, W.; Wernet, N.: Binary Search Trees: Average and Worst Case Behavior. In: GI - 6. Jahrestagung, S. 301 - 313. Untitled Event, Stuttgart, Germany, 29. September 1976. Springer, Berlin, Germany (1976)

Heydthausen, M.; Mehlhorn, K.: Top Down Parsing of Macro Grammars. In: GI - 6. Jahrestagung, S. 95 - 108. Untitled Event, Stuttgart, Germany, 29. September 1976. Springer, Berlin, Germany (1976)

Mehlhorn, K.: Best possible bounds for the weighted path length of optimum binary search trees. In: Automata Theory and Formal Languages, 2nd GI Conference, S. 31 - 41. Untitled Event, Kaiserslautern, Germany, 20. Mai 1975. Springer, Berlin, Germany (1975)

Mehlhorn, K.; Galil, Z.: Monotone Switching Circuits and Boolean Matrix Product. In: Mathematical foundations of computer science (MFCS-75): 4th symposium, S. 315 - 319. Untitled Event, Mariánské Lázne, Czechoslovakia, 01. September 1975. Springer, Berlin, Germany (1975)

Mehlhorn, K.: The 'almost all' theory of subrecursive degrees is decidable. In: Automata, languages and programming: 2nd colloquium (ICALP-74), S. 317 - 325. Untitled Event, Saarbrücken, Germany, 29. Juli 1974. Springer, Berlin, Germany (1974)

Mehlhorn, K.: Polynomial and Abstract Subrecursive Classes. In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), S. 96 - 109. Untitled Event, Seattle, Washington, USA, 30. April 1974. ACM, New York, NY, USA (1974)

Mehlhorn, K.: On the Size of Sets of Computable Functions. In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), S. 190 - 196. 14th Annual Symposium on Switching & Automata Theory, Iowa City, Iowa, USA, 15. Oktober 1973. IEEE, Northridge, CA, USA (1973)

Mehlhorn, K.; Sagraloff, M.: Isolating Real Roots of Real Polynomials. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, S. 247 - 254. 2009 International Symposium on Symbolic and Algebraic Computation, Seoul, Korea, 28. Juli 2009 - 31. Juli 2009. ACM, New York, NY (2009)

Ihrke, I.; Kutulakos, K. N.; Lensch, H.; Magnor, M.; Heidrich, W.: Transparent and Reflective Scene Reconstruction. In: EUROGRAPHICS 2008 - STate-of-the-Art Reports, S. 81 - 102 (Hg. Theoharis, T.; Dutre, P.). The European Association for Computer Graphics 29th Annual Conference, Crete, Greece, 14. April 2008 - 18. April 2008. The Eurographics Association, Geneve (2008)

Roomp, K.; Beerenwinkel, N.; Sing, T.; Schülter, E.; Büch, J.; Sierra-Aragon, S.; Däumer, M.; Hoffmann, D.; Kaiser, R.; Lengauer, T. et al.; Selbig, J.: Arevir: A Secure Platform for Designing Personalized Antiretroviral Therapies Against HIV. In: Lecture Notes in Bioinformatics, Bd. 4075, S. 185 - 194. Third International Workshop on Data Integration in the Life Sciences, Hinxton, UK, 22. Juli 2006. (2006)