U. Blass

Most-cited papers

1. Bounds on identifying codes

   U. Blass, I. Honkala, S. Litsyn

   2001Discrete Mathematics72 citations Open access

   Semantic Scholar

   Save

2. On binary codes for identification

   U. Blass, I. Honkala, S. Litsyn

   200065 citations

   Semantic Scholar

   Save

3. The Sprague-Grundy Function for Wythoff's Game

   U. Blass, A. Fraenkel

   1990Theoretical Computer Science45 citations Open access

   Semantic Scholar

   Save

4. How Far Can Nim in Disguise Be Stretched?

   U. Blass, A. Fraenkel, Romina Guelman

   1997Journal of Combinatorial Theory27 citations Open access

   Semantic Scholar

   Save

5. On the size of optimal binary codes of length 9 and covering radius 1

   P. Östergård, U. Blass

   2001IEEE Transactions on Information Theory23 citations

   Semantic Scholar

   Save

6. Several New Lower Bounds on the Size of Codes with Covering Radius One

   U. Blass, S. Litsyn

   1998IEEE Transactions on Information Theory12 citations

   Semantic Scholar

   Save

7. Short Dominating Paths and Cycles in the Binary Hypercube

   U. Blass, I. Honkala, M. Karpovsky, S. Litsyn

   20018 citations

   Semantic Scholar

   Save

8. On tHe Size of Identifying Codes

   U. Blass, I. Honkala, S. Litsyn

   1999International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes5 citations

   Semantic Scholar

   Save

9. The smallest covering code of length 8 and radius 2 has 12 words

   U. Blass, S. Litsyn

   1999Ars Comb.2 citations

   Semantic Scholar

   Save

10. Several new lower bounds for football pool systems

    U. Blass, S. Litsyn

    1998Ars Comb.2 citations

    Semantic Scholar

    Save