The Sprague-Grundy Function for Wythoff's Game. - Uri Blass; Aviezri S. Fraenkel (Theor. Comput. Sci., 1990)

Several new lower bounds for football pool systems. - Uri Blass; Simon Litsyn (Ars Comb., 1998)

How Far Can Nim in Disguise Be Stretched? - Uri Blass; Aviezri S. Fraenkel; Romina Guelman (J. Comb. Theory A, 1998)

Several New Lower Bounds on the Size of Codes with Covering Radius One. - Uri Blass; Simon Litsyn (IEEE Trans. Inf. Theory, 1998)

On tHe Size of Identifying Codes. - Uri Blass; Iiro S. Honkala; Simon Litsyn (AAECC, 1999)

The smallest covering code of length 8 and radius 2 has 12 words. - Uri Blass; Simon Litsyn (Ars Comb., 1999)

Bounds on identifying codes. - Uri Blass; Iiro S. Honkala; Simon Litsyn (Discret. Math., 2001)

On the size of optimal binary codes of length 9 and covering radius 1. - Patric R. J. Östergård; Uri Blass (IEEE Trans. Inf. Theory, 2001)