Search the dblp DataBase
Uri Blass :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Uri Blass , Iiro S. Honkala , Simon Litsyn On tHe Size of Identifying Codes. [Citation Graph (0, 0)][DBLP ] AAECC, 1999, pp:142-147 [Conf ] Uri Blass , Simon Litsyn Several new lower bounds for football pool systems. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:50, n:, pp:- [Journal ] Uri Blass , Simon Litsyn The smallest covering code of length 8 and radius 2 has 12 words. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1999, v:52, n:, pp:- [Journal ] Uri Blass , Iiro S. Honkala , Simon Litsyn Bounds on identifying codes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:241, n:1-3, pp:119-128 [Journal ] Uri Blass , Aviezri S. Fraenkel , Romina Guelman How Far Can Nim in Disguise Be Stretched? [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1998, v:84, n:2, pp:145-156 [Journal ] Uri Blass , Aviezri S. Fraenkel The Sprague-Grundy Function for Wythoff's Game. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1990, v:75, n:3, pp:311-333 [Journal ] Uri Blass , Simon Litsyn Several New Lower Bounds on the Size of Codes with Covering Radius One. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1998-2002 [Journal ] Patric R. J. Östergård , Uri Blass On the size of optimal binary codes of length 9 and covering radius 1. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2556-2557 [Journal ] Search in 0.002secs, Finished in 0.002secs