default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThorsten Bernholt
Person information
- affiliation: Technical University of Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j8]Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister:
Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. Discret. Comput. Geom. 42(1): 22-36 (2009)- 2007
- [j7]Robin Nunkesser
, Thorsten Bernholt, Holger Schwender, Katja Ickstadt, Ingo Wegener:
Detecting high-order interactions of single nucleotide polymorphisms using genetic programming. Bioinform. 23(24): 3280-3288 (2007) - [j6]Thorsten Bernholt, Robin Nunkesser, Karen Schettlinger:
Computing the least quartile difference estimator in the plane. Comput. Stat. Data Anal. 52(2): 763-772 (2007) - [c4]Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister:
A geometric framework for solving subsequence problems in computational biology efficiently. SCG 2007: 310-318 - 2006
- [b1]Thorsten Bernholt:
Effiziente Algorithmen und Komplexität in der robusten Statistik. Dortmund University, Germany, 2006 - [j5]Roland Fried, Thorsten Bernholt, Ursula Gather:
Repeated median and hybrid filters. Comput. Stat. Data Anal. 50(9): 2313-2338 (2006) - [j4]Thorsten Bernholt, Roland Fried, Ursula Gather, Ingo Wegener:
Modified repeated median filters. Stat. Comput. 16(2): 177-192 (2006) - [c3]Thorsten Bernholt, Thomas Hofmeister:
An Algorithm for a Generalized Maximum Subsequence Problem. LATIN 2006: 178-189 - 2005
- [c2]Thorsten Bernholt:
Computing the Least Median of Squares Estimator in Time O(nd). ICCSA (1) 2005: 697-706 - 2004
- [j3]Thorsten Bernholt, Paul Fischer:
The complexity of computing the MCD-estimator. Theor. Comput. Sci. 326(1-3): 383-398 (2004) - 2003
- [j2]Thorsten Bernholt, Roland Fried:
Computing the update of the repeated median regression line in linear time. Inf. Process. Lett. 88(3): 111-117 (2003) - 2002
- [j1]Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt, Ingo Wegener:
Komplexitätstheorie, effiziente Algorithmen und die Bundesliga. Inform. Spektrum 25(6): 488-502 (2002)
1990 – 1999
- 1999
- [c1]Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt:
Football Elimination Is Hard to Decide Under the 3-Point-Rule. MFCS 1999: 410-418
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
