Sprungmarken

Servicenavigation

       

Hauptnavigation

Bereichsnavigation

Hauptinhalt

Thorsten Bernholt

Dr. Thorsten Bernholt


Address: Since July 2007, I am working at
Olympus Soft Imaging Solutions in Münster(Westf).
Office: --- 
E-mail: Thorsten.Bernholtuni-dortmund.de
Phone: ---
Fax: --- 

Research Interests: Efficient algorithms, optimization, NP-hard-problems, robust statistics


Publications

  • Thorsten Bernholt, Friedrich Eisenbrand and Thomas Hofmeister(2009):
    Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently
    Discrete and Computational Geometry 42(1), pages 22-36, 2009. (pdf)
     
  • Oliver Morell, Thorsten Bernholt, Roland Fried, Joachim Kunert and Robin Nunkesser(2008):
    An Evolutionary Algorithm for LTS-Regression: A Comparative Study
    Proceedings in Computational Statistics (COMPSTAT 2008), volume II (Contributed Papers), pages 585-593.
     
  • Robin Nunkesser, Thorsten Bernholt, Holger Schwender, Katja Ickstadt and Ingo Wegener (2007):
    Detecting High-Order Interactions of Single Nucleotide Polymorphisms Using Genetic Programming
    Bioinformatics 23 (24), pages 3280-3288, Oxford University Press 2007 (doi).
    Technical Report 24/2007 (pdf), SFB 475, Universität Dortmund, Germany.
     
  • Thorsten Bernholt, Friedrich Eisenbrand and Thomas Hofmeister (2007):
    A Geometric Framework for Solving Subsequence Problems in Computational Biology Efficiently
    Proceedings of the 23rd Annual ACM Symposium on Computational Geometry (SoCG 2007), pages 310 - 318 .
     
  • Thorsten Bernholt (2006):
    Effiziente Algorithmen und Komplexität in der robusten Statistik
    Dissertation (pdf)Bibliothek Dortmund, Universität Dortmund  
     
  • Thorsten Bernholt, Roland Fried, Ursula Gather and Ingo Wegener (2006):
    Modified Repeated Median Filters
    Statistics and Computing 16, pages 177-192, Springer 2006.
    Technical Report 46/2004 (ps), SFB 475, University of Dortmund.  
     
  • Thorsten Bernholt and Thomas Hofmeister (2006):
    An Algorithm for a Generalized Maximum Subsequence Problem
    Proceedings of LATIN 2006, LNCS 3887, pages 178 - 189, 2006.
     
  • Thorsten Bernholt, Robin Nunkesser and Karen Schettlinger (2005/2007):
    Computing the Least Quartile Difference Estimator in the Plane
    Computational Statistics & Data Analysis 52 (2), pages 763-772, Elsevier 2007 (doi).
    Technical Report 51/2005 (ps), SFB 475, University of Dortmund.  
     
  • Thorsten Bernholt (2005):
    Robust Estimators are Hard to Compute
    Technical Report 52/2005 (pdf), SFB 475, University of Dortmund.  
     
  • Thorsten Bernholt (2005):
    Computing the Least Median of Squares Estimator in Time O(n^d)
    Proceedings of ICCSA 2005, LNCS 3480, pages 697–706, 2005.
    Preprint 25. Feburary 2005  (ps) (pdf) (Copyright link.springer.de)
    Technical Report 52/2005, SFB 475, University of Dortmund.  
     
  • Roland Fried, Thorsten Bernholt and Ursula Gather (2004/2006):
    Repeated Median and Hybrid Filters
    Computational Statistics & Data Analysis 50 (9), pages 2313-2338, Elsevier 2006.
    Revised Preprint 8. August 2004  (ps) (pdf)
    Technical Report 10/2004, SFB 475, University of Dortmund.  
     
  • Thorsten Bernholt and Paul Fischer (2004):
    The Complexity of Computing the MCD-Estimator.
    Theoretical Computer Science 326, pages 383-398, Elsevier 2004.
    Revised Preprint 10. October 2004   (ps)  (pdf)
    Computing Science and Statistics 33: Proceedings of the 33rd Symposium on the Interface 2001, Costa Mesa, California.
    Technical Report 45/2001, SFB 475, University of Dortmund   (ps)
     
  • Thorsten Bernholt and Roland Fried (2003):
    Computing the Update of the Repeated Median Regression Line in Linear Time.
    Information Processing Letters 88 (3), pages 111-117, Elsevier 2003.
    Revised Preprint 4. July 2003   (ps)
    Technical Report 43/2002, SFB 475, University of Dortmund.
     
  • Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt and Ingo Wegener (2002):
    Komplexitätstheorie, effiziente Algorithmen und die Bundesliga.
    Informatik-Spektrum 25(6), pages 488-502, Springer 2002.   (link.springer.de)
     
  • Thorsten Bernholt and Alexander Gülich (2000):
    Anwendung von Komplexitätstheorie und Effizienten Algorithmen auf die Fußballbundesliga.
    Diploma Thesis, University of Dortmund
    The complete German text is available for download:
    Postscript (7.57 MB)
    gzip'ed Postscript (1.44 MB)
    PDF (4.48 MB)
    gzip'ed PDF (2.06 MB)
     
  • Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister and Niels Schmitt (1999):
    Football Elimination ist Hard to Decide Under the 3-Point-Rule.
    Proceedings of 24th International Symposium on Mathematical Foundations of Computer Science (MFCS 99), LNCS 1672, pages 410-418, Szklarska Poreba, Poland


 Last modified: 14. July 2007