| 2001 | ||
|---|---|---|
| j7 | Uri Blass, Iiro S. Honkala, Simon Litsyn: Bounds on identifying codes. Discrete Mathematics 241(1-3): 119-128 (2001) | |
| j6 | Patric R. J. Östergård, Uri Blass: On the size of optimal binary codes of length 9 and covering radius 1. IEEE Transactions on Information Theory 47(6): 2556-2557 (2001) | |
| 1999 | ||
| j5 | Uri Blass, Simon Litsyn: The smallest covering code of length 8 and radius 2 has 12 words. Ars Comb. 52 (1999) | |
| c1 | ||
| 1998 | ||
| j4 | ||
| j3 | Uri Blass, Aviezri S. Fraenkel, Romina Guelman: How Far Can Nim in Disguise Be Stretched? J. Comb. Theory, Ser. A 84(2): 145-156 (1998) | |
| j2 | Uri Blass, Simon Litsyn: Several New Lower Bounds on the Size of Codes with Covering Radius One. IEEE Transactions on Information Theory 44(5): 1998-2002 (1998) | |
| 1990 | ||
| j1 | Uri Blass, Aviezri S. Fraenkel: The Sprague-Grundy Function for Wythoff's Game. Theor. Comput. Sci. 75(3): 311-333 (1990) | |
| 1 | Aviezri S. Fraenkel | |
| 2 | Romina Guelman | |
| 3 | Iiro S. Honkala | |
| 4 | Simon Litsyn | |
| 5 | Patric R. J. Östergård |
Colors in the list of coauthors
Last update Wed May 22 23:11:20 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page