New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. - Noga Alon; Uri Stav (Comb. Probab. Comput., 2004)

Non-Linear Index Coding Outperforming the Linear Optimum. - Eyal Lubetzky; Uri Stav (FOCS, 2007)

Graph edit distance and hereditary properties - Uri Stav (2007)

Broadcasting with Side Information. - Noga Alon; Eyal Lubetzky; Uri Stav; Amit Weinstein; Avinatan Hassidim (FOCS, 2008)

The maximum edit distance from hereditary graph properties. - Noga Alon; Uri Stav (J. Comb. Theory B, 2008)

What is the furthest graph from a hereditary property? - Noga Alon; Uri Stav (Random Struct. Algorithms, 2008)

Stability-type results for hereditary properties. - Noga Alon; Uri Stav (J. Graph Theory, 2009)

Can a Graph Have Distinct Regular Partitions? - Noga Alon; Asaf Shapira; Uri Stav (SIAM J. Discret. Math., 2009)

Hardness of edge-modification problems. - Noga Alon; Uri Stav (Theor. Comput. Sci., 2009)

Nonlinear index coding outperforming the linear optimum. - Eyal Lubetzky; Uri Stav (IEEE Trans. Inf. Theory, 2009)

Recovery CAT: A Digital Forensics Tool for Cryptocurrency Investigations. - Lilita Infante; Roger A. Hallman; John Hays; Evelyn Cronnon; Uri Stav (ISDFS, 2024)