Thomas Hofmeister - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2009

Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology EfficientlyThorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister. dcg, 42(1):22-36, 2009. [doi]

2007

A geometric framework for solving subsequence problems in computational biology efficientlyThorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister. compgeom 2007: 310-318 [doi]

Randomized Algorithms for 3-SATThomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe. mst, 40(3):249-262, 2007. [doi]

2006

An Algorithm for a Generalized Maximum Subsequence ProblemThorsten Bernholt, Thomas Hofmeister. latin 2006: 178-189 [doi]

2003

An Approximation Algorithm for MAX-2-SAT with Cardinality ConstraintThomas Hofmeister. esa 2003: 301-312 [doi]

2002

Komplexitätstheorie, effiziente Algorithmen und die BundesligaThorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt, Ingo Wegener. insk, 25(6):488-502, 2002. [doi]

A Probabilistic 3-SAT Algorithm Further ImprovedThomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe. STACS 2002: 192-202 [doi]

2000

An Algorithm for Heilbronn s ProblemClaudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann. SICOMP, 30(2):383-390, 2000.

Contrast-optimal k out of n secret sharing schemes in visual cryptographyThomas Hofmeister, Matthias Krause, Hans-Ulrich Simon. TCS, 240(2):471-485, 2000. [doi]

1999

Football Elimination Is Hard to Decide Under the 3-Point-RuleThorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt. mfcs 1999: 410-418

Sparse 0-1-Matrices And Forbidden HypergraphsClaudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann. cpc, 8(5):417-427, 1999.

An Application of Codes to Attribute-Efficient LearningThomas Hofmeister. eurocolt 1999: 101-110 [doi]

1998

Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract)Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann. soda 1998: 181-187

On k-Partite SubgraphsThomas Hofmeister, Hanno Lefmann. arscom, 50, 1998.

Approximating Maximum Independent Sets in Uniform HypergraphsThomas Hofmeister, Hanno Lefmann. mfcs 1998: 562-570 [doi]

1997

An Algorithm for Heilbronn s ProblemClaudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann. cocoon 1997: 23-31

Contrast-Optimal k out of n Secret Sharing Schemes in Visual CryptographyThomas Hofmeister, Matthias Krause, Hans-Ulrich Simon. cocoon 1997: 176-185

Semidefinite Programming and Its Applications to Approximation AlgorithmsThomas Hofmeister, Martin Hühne. Dagstuhl 1998: 263-298 [doi]

1996

Multiple Product Modulo Arbitrary NumbersClaudia Bertram-Kretzberg, Thomas Hofmeister. iandc, 131(1):81-93, 1996.

A Note on the Simulation of Exponential Threshold WeightsThomas Hofmeister. cocoon 1996: 136-141

A combinatorial design approach to MAXCUTThomas Hofmeister, Hanno Lefmann. rsa, 9(1-2):163-175, 1996.

Independent Sets in Graphs with TrianglesThomas Hofmeister, Hanno Lefmann. ipl, 58(5):207-210, 1996. [doi]

A Combinatorial Design Approach to MAXCUTThomas Hofmeister, Hanno Lefmann. STACS 1996: 441-452

1995

Multiple Product Modulo Arbitrary NumbersClaudia Bertram-Kretzberg, Thomas Hofmeister. eccc, 2(17), 1995. [doi]

Multiple Product Modulo Arbitrary NumbersClaudia Bertram-Kretzberg, Thomas Hofmeister. mfcs 1995: 288-298

Derandomization for Sparse Approximations and Independent SetsThomas Hofmeister, Hanno Lefmann. mfcs 1995: 201-210

1993

Thresholdschaltkreise kleiner TiefeThomas Hofmeister. PhD thesis, Technical University of Dortmund, Germany, 1993. [doi]

Depth efficient neural networks for division and related problemsKai-Yeung Siu, Jehoshua Bruck, Thomas Kailath, Thomas Hofmeister. TIT, 39(3):946-956, 1993.

1992

The Power of Negative Thinking in Constructing Threshold Circuits for AdditionThomas Hofmeister. coco 1992: 20-26

1991

Some Notes on Threshold Circuits, and Multiplication in Depth 4Thomas Hofmeister, Walter Hohberg, Susanne Köhling. ipl, 39(4):219-225, 1991.

Some Notes on Threshold Circuits, and Multiplication in Depth 4Thomas Hofmeister, Walter Hohberg, Susanne Köhling. fct 1991: 230-239

Sign in or sign up to see more results.

runs on WebDSL