IndexBrowse   BibliographiesMy selection
 Search: in   (word length ≥ 3)
       Login
References of Kurt Mehlhorn   Download bibtex file Order by:   Type | Year
<< 2003 >> TOP
1 Add to my selection
Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren and Sven Thiel. An Efficient Graph Algorithm for Dominance Constraints. In Journal of Algorithms, Vol. 48:194--219, 2003. URL [Abstract]   Bibtex entry  google [Annote]
<< 2001 >> TOP
2 Add to my selection
Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren and Sven Thiel. An Efficient Algorithm for the Configuration Problem of Dominance Graphs. In 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 7-9, ACM Press, Washington D.C., USA, 2001. URL [Abstract]   Bibtex entry  google [Annote]
<< 2000 >> TOP
3 Add to my selection
Katrin Erk. Die Verarbeitung von Parallelismus-Constraints. In Kurt Mehlhorn and G. Snelting editors, Informatik 2000 - 30. Jahrestagung der Gesellschaft für Informatik, 19.-22. September, Springer, Berlin, Germany, 2000. URL [Abstract]   Bibtex entry  google [Annote]
4 Add to my selection
Alexander Koller, Kurt Mehlhorn and Joachim Niehren. A Polynomial-Time Fragment of Dominance Constraints. In 38th Annual Meeting of the Association of Computational Linguistics (ACL '00), October 1-8, Hong Kong, 2000. URL [Abstract]   Bibtex entry  google [Annote]
Last modified: Thu October 16 2014 19:11:34         BibAdmin