default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Hofmeister
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
[j12]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
- [j11]Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
Randomized Algorithms for 3-SAT. Theory Comput. Syst. 40(3): 249-262 (2007) - [c17]Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister:
A geometric framework for solving subsequence problems in computational biology efficiently. SCG 2007: 310-318 - 2006
- [c16]Thorsten Bernholt, Thomas Hofmeister:
An Algorithm for a Generalized Maximum Subsequence Problem. LATIN 2006: 178-189 - 2003
- [c15]Thomas Hofmeister:
An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint. ESA 2003: 301-312 - 2002
- [j10]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) - [c14]Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
A Probabilistic 3-SAT Algorithm Further Improved. STACS 2002: 192-202 - 2000
- [j9]Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
An Algorithm for Heilbronn's Problem. SIAM J. Comput. 30(2): 383-390 (2000) - [j8]Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon:
Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240(2): 471-485 (2000)
1990 – 1999
- 1999
- [j7]Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
Sparse 0-1-Matrices And Forbidden Hypergraphs. Comb. Probab. Comput. 8(5): 417-427 (1999) - [c13]Thomas Hofmeister:
An Application of Codes to Attribute-Efficient Learning. EuroCOLT 1999: 101-110 - [c12]Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt:
Football Elimination Is Hard to Decide Under the 3-Point-Rule. MFCS 1999: 410-418 - 1998
- [j6]Thomas Hofmeister, Hanno Lefmann:
On k-Partite Subgraphs. Ars Comb. 50 (1998) - [c11]Thomas Hofmeister, Hanno Lefmann:
Approximating Maximum Independent Sets in Uniform Hypergraphs. MFCS 1998: 562-570 - [c10]Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract). SODA 1998: 181-187 - 1997
- [c9]Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
An Algorithm for Heilbronn's Problem. COCOON 1997: 23-31 - [c8]Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon:
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. COCOON 1997: 176-185 - [c7]Thomas Hofmeister, Martin Hühne:
Semidefinite Programming and Its Applications to Approximation Algorithms. Lectures on Proof Verification and Approximation Algorithms 1997: 263-298 - 1996
- [j5]Claudia Bertram-Kretzberg, Thomas Hofmeister:
Multiple Product Modulo Arbitrary Numbers. Inf. Comput. 131(1): 81-93 (1996) - [j4]Thomas Hofmeister, Hanno Lefmann:
Independent Sets in Graphs with Triangles. Inf. Process. Lett. 58(5): 207-210 (1996) - [j3]Thomas Hofmeister, Hanno Lefmann:
A combinatorial design approach to MAXCUT. Random Struct. Algorithms 9(1-2): 163-175 (1996) - [c6]Thomas Hofmeister:
A Note on the Simulation of Exponential Threshold Weights. COCOON 1996: 136-141 - [c5]Thomas Hofmeister, Hanno Lefmann:
A Combinatorial Design Approach to MAXCUT. STACS 1996: 441-452 - 1995
- [c4]Thomas Hofmeister, Hanno Lefmann:
Derandomization for Sparse Approximations and Independent Sets. MFCS 1995: 201-210 - [c3]Claudia Bertram-Kretzberg, Thomas Hofmeister:
Multiple Product Modulo Arbitrary Numbers. MFCS 1995: 288-298 - [i1]Claudia Bertram-Kretzberg, Thomas Hofmeister:
Multiple Product Modulo Arbitrary Numbers. Electron. Colloquium Comput. Complex. TR95 (1995) - 1993
- [b1]Thomas Hofmeister:
Thresholdschaltkreise kleiner Tiefe. Technical University of Dortmund, Germany, 1993, pp. 1-86 - [j2]Kai-Yeung Siu, Jehoshua Bruck, Thomas Kailath, Thomas Hofmeister:
Depth efficient neural networks for division and related problems. IEEE Trans. Inf. Theory 39(3): 946-956 (1993) - 1992
- [c2]Thomas Hofmeister:
The Power of Negative Thinking in Constructing Threshold Circuits for Addition. SCT 1992: 20-26 - 1991
- [j1]Thomas Hofmeister, Walter Hohberg, Susanne Köhling:
Some Notes on Threshold Circuits, and Multiplication in Depth 4. Inf. Process. Lett. 39(4): 219-225 (1991) - [c1]Thomas Hofmeister, Walter Hohberg, Susanne Köhling:
Some Notes on Threshold Circuits, and Multiplication in Depth 4. FCT 1991: 230-239
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-04-25 05:38 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:
