- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| j12 |      | Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister: Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. Discrete & Computational Geometry 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. Symposium on Computational Geometry 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. Informatik 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) |
| 1999 | ||
| j7 | | Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann: Sparse 0-1-Matrices And Forbidden Hypergraphs. Combinatorics, Probability & Computing 8(5): 417-427 (1999) |
| c13 | | |
| 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 |  | |
| 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 | | |
| c5 | | |
| 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. Electronic Colloquium on Computational Complexity (ECCC) 2(17) (1995) |
| 1993 | ||
| j2 | | 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 | ||
| c2 | | Thomas Hofmeister: The Power of Negative Thinking in Constructing Threshold Circuits for Addition. Structure in Complexity Theory Conference 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 |
Colors in the list of coauthors
Last update Tue May 21 13:23:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page