The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Hofmeister: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  30. Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002