Searching for authors named "Hanno Lefmann" – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
MOD p -tests, Almost Independence and Small Probability Spaces
- …-Kretzberg and Hanno Lefmann Lehrstuhl Informatik II, Universitat Dortmund, D-44221 Dortmund, Germany bertram/lefmann…
- Add To MetaCart
-
Point Sets with Distinct Distances
- …SERIE B --- INFORMATIK Point Sets with Distinct Distances Hanno Lefmann* Torsten Thiele** B 94…
- Cited by 2 (1 self) – Add To MetaCart
-
The Algorithmic Aspects of Uncrowded Hypergraphs
- …The Algorithmic Aspects of Uncrowded Hypergraphs y Claudia Bertram-Kretzberg and Hanno Lefmann…
- Cited by 3 (3 self) – Add To MetaCart
-
Some Typical Properties of Large AND/OR Boolean Formulas
- …Some Typical Properties of Large AND/OR Boolean Formulas Hanno Lefmann Universitat Dortmund FB…
- Cited by 9 (1 self) – Add To MetaCart
-
MODp-tests, almost independence and small probability spaces. Random Structures Algorithms
- …MODp-tests, Almost Independence and Small Probability Spaces Claudia Bertram-Kretzberg and Hanno…
- Cited by 1 (0 self) – Add To MetaCart
-
Approximating Maximum Independent Sets in Uniform Hypergraphs
- …Approximating Maximum Independent Sets in Uniform Hypergraphs Thomas Hofmeister / Hanno Lefmann…
- Cited by 12 (0 self) – Add To MetaCart
-
Proper Bounded Edge-Colorings
- …Proper Bounded Edge-Colorings Claudia Bertram-Kretzberg -- , Hanno Lefmann -- , Vojtech Rodl…
- Add To MetaCart
-
A Comparison of Approximation Algorithms for the MaxCut-Problem
- …, Hanno Lefmann y Universitat Dortmund, Informatik 2, D{44221 Dortmund, Germany Abstract In this paper we…
- Cited by 3 (0 self) – Add To MetaCart
-
An algorithm for Heilbronn's problem
- …An Algorithm for Heilbronn's Problem Claudia Bertram-Kretzberg / Thomas Hofmeister / Hanno Lefmann…
- Cited by 5 (0 self) – Add To MetaCart
-
On Sparse Parity Check Matrices
- …On Sparse Parity Check Matrices Hanno Lefmann Pavel Pudl'ak y Petr Savick'y z November 3…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
