| * | 2008 |
|---|
| 8 | EE | Noga Alon,
Eyal Lubetzky,
Uri Stav,
Amit Weinstein,
Avinatan Hassidim:
Broadcasting with Side Information.
FOCS 2008: 823-832 |
| 7 | EE | Eyal Lubetzky,
Uri Stav:
Non-linear index coding outperforming the linear optimum
CoRR abs/0806.1919: (2008) |
| 6 | EE | Noga Alon,
Avinatan Hassidim,
Eyal Lubetzky,
Uri Stav,
Amit Weinstein:
Broadcasting with side information
CoRR abs/0806.3246: (2008) |
| 5 | EE | Noga Alon,
Uri Stav:
The maximum edit distance from hereditary graph properties.
J. Comb. Theory, Ser. B 98(4): 672-697 (2008) |
| 4 | EE | Noga Alon,
Uri Stav:
What is the furthest graph from a hereditary property?
Random Struct. Algorithms 33(1): 87-104 (2008) |
| 2007 |
|---|
| 3 | EE | Noga Alon,
Asaf Shapira,
Uri Stav:
Can a Graph Have Distinct Regular Partitions?
COCOON 2007: 428-438 |
| 2 | EE | Eyal Lubetzky,
Uri Stav:
Non-Linear Index Coding Outperforming the Linear Optimum.
FOCS 2007: 161-168 |
| 2004 |
|---|
| 1 | EE | Noga Alon,
Uri Stav:
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents.
Combinatorics, Probability & Computing 37(6): 795-807 (2004) |
