| 2007 |
|---|
| 29 | EE | Thorsten Bernholt,
Friedrich Eisenbrand,
Thomas Hofmeister:
A geometric framework for solving subsequence problems in computational biology efficiently.
Symposium on Computational Geometry 2007: 310-318 |
| 28 | EE | Thomas Hofmeister,
Uwe Schöning,
Rainer Schuler,
Osamu Watanabe:
Randomized Algorithms for 3-SAT.
Theory Comput. Syst. 40(3): 249-262 (2007) |
| 2006 |
|---|
| 27 | EE | Thorsten Bernholt,
Thomas Hofmeister:
An Algorithm for a Generalized Maximum Subsequence Problem.
LATIN 2006: 178-189 |
| 2003 |
|---|
| 26 | EE | Thomas Hofmeister:
An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint.
ESA 2003: 301-312 |
| 2002 |
|---|
| 25 | EE | Thomas Hofmeister,
Uwe Schöning,
Rainer Schuler,
Osamu Watanabe:
A Probabilistic 3-SAT Algorithm Further Improved.
STACS 2002: 192-202 |
| 24 | EE | Thorsten Bernholt,
Alexander Gülich,
Thomas Hofmeister,
Niels Schmitt,
Ingo Wegener:
Komplexitätstheorie, effiziente Algorithmen und die Bundesliga.
Informatik Spektrum 25(6): 488-502 (2002) |
| 2000 |
|---|
| 23 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister,
Hanno Lefmann:
An Algorithm for Heilbronn's Problem.
SIAM J. Comput. 30(2): 383-390 (2000) |
| 22 | EE | 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) |
| 1999 |
|---|
| 21 | EE | Thomas Hofmeister:
An Application of Codes to Attribute-Efficient Learning.
EuroCOLT 1999: 101-110 |
| 20 | | Thorsten Bernholt,
Alexander Gülich,
Thomas Hofmeister,
Niels Schmitt:
Football Elimination Is Hard to Decide Under the 3-Point-Rule.
MFCS 1999: 410-418 |
| 19 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister,
Hanno Lefmann:
Sparse 0-1-Matrices And Forbidden Hypergraphs
Combinatorics, Probability & Computing 8(5): (1999) |
| 1998 |
|---|
| 18 | EE | Thomas Hofmeister,
Hanno Lefmann:
Approximating Maximum Independent Sets in Uniform Hypergraphs.
MFCS 1998: 562-570 |
| 17 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister,
Hanno Lefmann:
Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract).
SODA 1998: 181-187 |
| 16 | | Thomas Hofmeister,
Hanno Lefmann:
On k-Partite Subgraphs.
Ars Comb. 50: (1998) |
| 1997 |
|---|
| 15 | | Thomas Hofmeister,
Matthias Krause,
Hans-Ulrich Simon:
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography.
COCOON 1997: 176-185 |
| 14 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister,
Hanno Lefmann:
An Algorithm for Heilbronn's Problem.
COCOON 1997: 23-31 |
| 13 | EE | Thomas Hofmeister,
Martin Hühne:
Semidefinite Programming and Its Applications to Approximation Algorithms.
Lectures on Proof Verification and Approximation Algorithms 1997: 263-298 |
| 1996 |
|---|
| 12 | | Thomas Hofmeister:
A Note on the Simulation of Exponential Threshold Weights.
COCOON 1996: 136-141 |
| 11 | | Thomas Hofmeister,
Hanno Lefmann:
A Combinatorial Design Approach to MAXCUT.
STACS 1996: 441-452 |
| 10 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister:
Multiple Product Modulo Arbitrary Numbers.
Inf. Comput. 131(1): 81-93 (1996) |
| 9 | EE | Thomas Hofmeister,
Hanno Lefmann:
Independent Sets in Graphs with Triangles.
Inf. Process. Lett. 58(5): 207-210 (1996) |
| 8 | | Thomas Hofmeister,
Hanno Lefmann:
A combinatorial design approach to MAXCUT.
Random Struct. Algorithms 9(1-2): 163-175 (1996) |
| 1995 |
|---|
| 7 | | Thomas Hofmeister,
Hanno Lefmann:
Derandomization for Sparse Approximations and Independent Sets.
MFCS 1995: 201-210 |
| 6 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister:
Multiple Product Modulo Arbitrary Numbers.
MFCS 1995: 288-298 |
| 5 | EE | Claudia Bertram-Kretzberg,
Thomas Hofmeister:
Multiple Product Modulo Arbitrary Numbers
Electronic Colloquium on Computational Complexity (ECCC) 2(17): (1995) |
| 1993 |
|---|
| 4 | | Kai-Yeung Siu,
Jehoshua Bruck,
Thomas Kailath,
Thomas Hofmeister:
Depth efficient neural networks for division and related problems.
IEEE Transactions on Information Theory 39(3): 946-956 (1993) |
| 1992 |
|---|
| 3 | | Thomas Hofmeister:
The Power of Negative Thinking in Constructing Threshold Circuits for Addition.
Structure in Complexity Theory Conference 1992: 20-26 |
| 1991 |
|---|
| 2 | | Thomas Hofmeister,
Walter Hohberg,
Susanne Köhling:
Some Notes on Threshold Circuits, and Multiplication in Depth 4.
FCT 1991: 230-239 |
| 1 | | 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) |
