Uri Stav

According to our database, Uri Stav authored at least 10 papers between 2004 and 2009.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2009

Nonlinear index coding outperforming the linear optimum.

Eyal Lubetzky, Uri Stav

IEEE Trans. Inf. Theory, 2009

Hardness of edge-modification problems.

Noga Alon, Uri Stav

Theor. Comput. Sci., 2009

Can a Graph Have Distinct Regular Partitions?

Noga Alon, Asaf Shapira, Uri Stav

SIAM J. Discret. Math., 2009

Stability-type results for hereditary properties.

Noga Alon, Uri Stav

J. Graph Theory, 2009

2008

What is the furthest graph from a hereditary property?

Noga Alon, Uri Stav

Random Struct. Algorithms, 2008

The maximum edit distance from hereditary graph properties.

Noga Alon, Uri Stav

J. Comb. Theory, Ser. B, 2008

Broadcasting with Side Information.

Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Graph edit distance and hereditary properties

Uri Stav

PhD thesis, 2007

Non-Linear Index Coding Outperforming the Linear Optimum.

Eyal Lubetzky, Uri Stav

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2004

New Bounds on Parent-Identifying Codes: The Case of Multiple Parents.

Noga Alon, Uri Stav

Comb. Probab. Comput., 2004