Thomas Hofmeister

Discret. Comput. Geom., 2009

2007

Randomized Algorithms for 3-SAT.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

A geometric framework for solving subsequence problems in computational biology efficiently.

[BibT_eX]

[DOI]

Thorsten Bernholt

Friedrich Eisenbrand

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

An Algorithm for a Generalized Maximum Subsequence Problem.

[BibT_eX]

[DOI]

Thorsten Bernholt

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2003

An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Komplexitätstheorie, effiziente Algorithmen und die Bundesliga.

[BibT_eX]

[DOI]

Inform. Spektrum, 2002

A Probabilistic 3-SAT Algorithm Further Improved.

[BibT_eX]

[DOI]

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2000

Contrast-optimal k out of n secret sharing schemes in visual cryptography.

[BibT_eX]

[DOI]

Matthias Krause

Hans Ulrich Simon

Theor. Comput. Sci., 2000

An Algorithm for Heilbronn's Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

1999

Sparse 0-1-Matrices And Forbidden Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1999

Football Elimination Is Hard to Decide Under the 3-Point-Rule.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

An Application of Codes to Attribute-Efficient Learning.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, 4th European Conference, 1999

1998

On k-Partite Subgraphs.

[BibT_eX]

Ars Comb., 1998

Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximating Maximum Independent Sets in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Semidefinite Programming and Its Applications to Approximation Algorithms.

[BibT_eX]

[DOI]

Martin Hühne

Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1996

A combinatorial design approach to MAXCUT.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Independent Sets in Graphs with Triangles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

A Note on the Simulation of Exponential Threshold Weights.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Multiple Product Modulo Arbitrary Numbers

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

Derandomization for Sparse Approximations and Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993

Thresholdschaltkreise kleiner Tiefe.

[BibT_eX]

[DOI]

PhD thesis, 1993

Depth efficient neural networks for division and related problems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

1992

The Power of Negative Thinking in Constructing Threshold Circuits for Addition.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991

Some Notes on Threshold Circuits, and Multiplication in Depth 4.

[BibT_eX]

[DOI]