The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hanno Lefmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak
    Approximations with Axis-Aligned Rectangles (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    FCT, 1993, pp:244-255 [Conf]
  2. Hanno Lefmann
    Distributions of Points and Large Convex Hulls of k Points. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:173-184 [Conf]
  3. Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
    An Algorithm for Heilbronn's Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:23-31 [Conf]
  4. Hanno Lefmann
    Sparse Parity-Check Matrices over Finite Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:112-121 [Conf]
  5. Hanno Lefmann
    Large Triangles in the d-Dimensional Unit-Cube. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:43-52 [Conf]
  6. Hanno Lefmann
    Distributions of Points in d Dimensions and Large k-Point Simplices. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:514-523 [Conf]
  7. Hanno Lefmann, Pavel Pudlák, Petr Savický
    On Sparse Parity Chack Matrices (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:41-49 [Conf]
  8. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
    The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:473-481 [Conf]
  9. Hanno Lefmann
    Distributions of Points and Large Quadrangles. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:657-668 [Conf]
  10. Hanno Lefmann, Niels Schmitt
    A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:165-180 [Conf]
  11. Thomas Hofmeister, Hanno Lefmann
    Derandomization for Sparse Approximations and Independent Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:201-210 [Conf]
  12. Thomas Hofmeister, Hanno Lefmann
    Approximating Maximum Independent Sets in Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:562-570 [Conf]
  13. Hanno Lefmann, Petr Savický
    Some Typical Properties of Large AND/OR Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:237-246 [Conf]
  14. 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]
  15. Claudia Bertram-Kretzberg, Hanno Lefmann
    The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:296-304 [Conf]
  16. Hanno Lefmann
    On Heilbronn's problem in higher dimension. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:60-64 [Conf]
  17. Hanno Lefmann
    Distributions of points in the unit-square and large k-gons. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:241-250 [Conf]
  18. Claudia Bertram-Kretzberg, Hanno Lefmann
    MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:141-152 [Conf]
  19. Thomas Hofmeister, Hanno Lefmann
    A Combinatorial Design Approach to MAXCUT. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:441-452 [Conf]
  20. Thomas Hofmeister, Hanno Lefmann
    On k-Partite Subgraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  21. Walter A. Deuber, Neil Hindman, Imre Leader, Hanno Lefmann
    Infinite Partition Regular Matrices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:333-355 [Journal]
  22. Hanno Lefmann
    On Heilbronn's Problem in Higher Dimension. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:4, pp:669-680 [Journal]
  23. Hanno Lefmann
    An extremal problem for Graham-Rotschild parameter words. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:2, pp:153-160 [Journal]
  24. Hanno Lefmann, Vojtech Rödl
    On Erdös-Rado Numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:85-104 [Journal]
  25. Hanno Lefmann, Torsten Thiele
    Point Sets with Distinct Distances. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:379-408 [Journal]
  26. 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]
  27. Hanno Lefmann
    Sparse Parity-Check Matrices over ${GF(q)}$. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:147-169 [Journal]
  28. Hanno Lefmann, Pavel Pudlák, Petr Savický
    On Sparse Parity Check Matrices. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:12, n:2, pp:107-130 [Journal]
  29. Heiko Harborth, Hanno Lefmann
    Coloring arcs of convex sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:107-117 [Journal]
  30. 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]
  31. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
    The Algorithmic Aspects of the Regularity Lemma. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:1, pp:80-109 [Journal]
  32. Vitaly Bergelson, Walter A. Deuber, Neil Hindman, Hanno Lefmann
    Rado's Theorem for Commutative Rings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:66, n:1, pp:68-92 [Journal]
  33. Neil Hindman, Hanno Lefmann
    Partition Regularity of (M, P, C)-Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:64, n:1, pp:1-9 [Journal]
  34. Hanno Lefmann
    A canonical version for partition regular systems of linear equations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:1, pp:95-104 [Journal]
  35. Hanno Lefmann
    A note on monoton waves. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:50, n:2, pp:316-318 [Journal]
  36. Hanno Lefmann
    On partition regular systems of equations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:35-53 [Journal]
  37. Hanno Lefmann, Kevin T. Phelps, Vojtech Rödl
    Rigid Linear Binary Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:63, n:1, pp:110-128 [Journal]
  38. Hanno Lefmann, Vojtech Rödl
    On Canonical Ramsey Numbers for Complete Graphs versus Paths. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:58, n:1, pp:1-13 [Journal]
  39. Hanno Lefmann, Vojtech Rödl, Beata Wysocka
    Multicolored Subsets in Colored Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:2, pp:209-248 [Journal]
  40. Claudia Bertram-Kretzberg, Hanno Lefmann
    MODp-tests, almost independence and small probability spaces. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:4, pp:293-313 [Journal]
  41. Richard A. Duke, Hanno Lefmann, Vojtech Rödl
    On Uncrowded Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:209-212 [Journal]
  42. 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]
  43. Hanno Lefmann, Petr Savický
    Some typical properties of large AND/OR Boolean formulas. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:3, pp:337-351 [Journal]
  44. 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]
  45. Claudia Bertram-Kretzberg, Hanno Lefmann
    The Algorithmic Aspects of Uncrowded Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:201-230 [Journal]
  46. Richard A. Duke, Hanno Lefmann, Vojtech Rödl
    A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:3, pp:598-620 [Journal]
  47. Hanno Lefmann, Niels Schmitt
    A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1926-1947 [Journal]
  48. Hanno Lefmann, Bernd Voigt
    Partitions of Aomega. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:4, pp:524-529 [Journal]
  49. Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann
    PAC-Learning from General Examples. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:43-65 [Journal]
  50. Hanno Lefmann
    Large triangles in the d-dimensional unit cube. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:85-98 [Journal]
  51. Hanno Lefmann
    Convex Hulls of Point-Sets and Non-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:285-295 [Conf]
  52. Hanno Lefmann
    Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:230-241 [Conf]
  53. Hanno Lefmann, Bernd Voigt
    A remark on infinite arithmetic progressions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:285-286 [Journal]
  54. Neil Hindman, Hanno Lefmann
    Canonical partition relations for (m, p, c)-systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:151-174 [Journal]
  55. Hanno Lefmann
    Non t-intersecting families of linear spaces over GF(q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:2, pp:173-183 [Journal]
  56. Arie Bialostocki, Hanno Lefmann, Terry Meerdink
    On the degree of regularity of some equations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:49-60 [Journal]
  57. Dwight Duffus, Hanno Lefmann, Vojtech Rödl
    Shift graphs and lower bounds on Ramsey numbers rk(l; r). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:177-187 [Journal]
  58. Arie Bialostocki, Paul Erdös, Hanno Lefmann
    Monochromatic and zero-sum sets of nondecreasing diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:19-34 [Journal]

  59. No lGrid-Points in Spaces of Small Dimension. [Citation Graph (, )][DBLP]


  60. On Colourings of Hypergraphs Without Monochromatic Fano Planes. [Citation Graph (, )][DBLP]


  61. Distributions of Points in d Dimensions and Large k -Point Simplices. [Citation Graph (, )][DBLP]


  62. Distributions of points in the unit square and large k-gons. [Citation Graph (, )][DBLP]


  63. Generalizations of Heilbronn's triangle problem. [Citation Graph (, )][DBLP]


Search in 0.201secs, Finished in 0.203secs
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