Some Notes on Threshold Circuits, and Multiplication in Depth 4. - Thomas Hofmeister; Walter Hohberg; Susanne Köhling (Inf. Process. Lett., 1991)

The Power of Negative Thinking in Constructing Threshold Circuits for Addition. - Thomas Hofmeister (SCT, 1992)

Depth efficient neural networks for division and related problems. - Kai-Yeung Siu; Jehoshua Bruck; Thomas Kailath; Thomas Hofmeister (IEEE Trans. Inf. Theory, 1993)

Thresholdschaltkreise kleiner Tiefe. - Thomas Hofmeister (1993)

Derandomization for Sparse Approximations and Independent Sets. - Thomas Hofmeister; Hanno Lefmann (MFCS, 1995)

Multiple Product Modulo Arbitrary Numbers - Claudia Bertram-Kretzberg; Thomas Hofmeister (Electron. Colloquium Comput. Complex., 1995)

A Note on the Simulation of Exponential Threshold Weights. - Thomas Hofmeister (COCOON, 1996)

Independent Sets in Graphs with Triangles. - Thomas Hofmeister; Hanno Lefmann (Inf. Process. Lett., 1996)

A combinatorial design approach to MAXCUT. - Thomas Hofmeister; Hanno Lefmann (Random Struct. Algorithms, 1996)

Semidefinite Programming and Its Applications to Approximation Algorithms. - Thomas Hofmeister; Martin Hühne (Lectures on Proof Verification and Approximation Algorithms, 1997)

Approximating Maximum Independent Sets in Uniform Hypergraphs. - Thomas Hofmeister; Hanno Lefmann (MFCS, 1998)

Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract). - Claudia Bertram-Kretzberg; Thomas Hofmeister; Hanno Lefmann (SODA, 1998)

On k-Partite Subgraphs. - Thomas Hofmeister; Hanno Lefmann (Ars Comb., 1998)

An Application of Codes to Attribute-Efficient Learning. - Thomas Hofmeister (EuroCOLT, 1999)

Football Elimination Is Hard to Decide Under the 3-Point-Rule. - Thorsten Bernholt; Alexander Gülich; Thomas Hofmeister; Niels Schmitt (MFCS, 1999)

Sparse 0-1-Matrices And Forbidden Hypergraphs. - Claudia Bertram-Kretzberg; Thomas Hofmeister; Hanno Lefmann (Comb. Probab. Comput., 1999)

An Algorithm for Heilbronn's Problem. - Claudia Bertram-Kretzberg; Thomas Hofmeister; Hanno Lefmann (SIAM J. Comput., 2000)

Contrast-optimal k out of n secret sharing schemes in visual cryptography. - Thomas Hofmeister; Matthias Krause 001; Hans Ulrich Simon (Theor. Comput. Sci., 2000)

A Probabilistic 3-SAT Algorithm Further Improved. - Thomas Hofmeister; Uwe Schöning; Rainer Schuler; Osamu Watanabe 001 (STACS, 2002)

Komplexitätstheorie, effiziente Algorithmen und die Bundesliga. - Thorsten Bernholt; Alexander Gülich; Thomas Hofmeister; Niels Schmitt; Ingo Wegener (Inform. Spektrum, 2002)

An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint. - Thomas Hofmeister (ESA, 2003)

An Algorithm for a Generalized Maximum Subsequence Problem. - Thorsten Bernholt; Thomas Hofmeister (LATIN, 2006)

A geometric framework for solving subsequence problems in computational biology efficiently. - Thorsten Bernholt; Friedrich Eisenbrand; Thomas Hofmeister (SCG, 2007)

Randomized Algorithms for 3-SAT. - Thomas Hofmeister; Uwe Schöning; Rainer Schuler; Osamu Watanabe 001 (Theory Comput. Syst., 2007)

Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. - Thorsten Bernholt; Friedrich Eisenbrand; Thomas Hofmeister (Discret. Comput. Geom., 2009)