Uri Stav (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

9 Noga Alon, Uri Stav: Hardness of edge-modification problems. Theor. Comput. Sci. 410(47-49): 4920-4927 (2009)

8 Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim: Broadcasting with Side Information. FOCS 2008: 823-832

6 Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein: Broadcasting with side information CoRR abs/0806.3246: (2008)

5 Noga Alon, Uri Stav: The maximum edit distance from hereditary graph properties. J. Comb. Theory, Ser. B 98(4): 672-697 (2008)

4 Noga Alon, Uri Stav: What is the furthest graph from a hereditary property? Random Struct. Algorithms 33(1): 87-104 (2008)

3 Noga Alon, Asaf Shapira, Uri Stav: Can a Graph Have Distinct Regular Partitions? COCOON 2007: 428-438

1 Noga Alon, Uri Stav: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. Combinatorics, Probability & Computing 37(6): 795-807 (2004)

Selection of 7 from 9 records - Uri Stav has 5 coauthors

9		Noga Alon, Uri Stav: Hardness of edge-modification problems. Theor. Comput. Sci. 410(47-49): 4920-4927 (2009)
8		Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim: Broadcasting with Side Information. FOCS 2008: 823-832
6		Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein: Broadcasting with side information CoRR abs/0806.3246: (2008)
5		Noga Alon, Uri Stav: The maximum edit distance from hereditary graph properties. J. Comb. Theory, Ser. B 98(4): 672-697 (2008)
4		Noga Alon, Uri Stav: What is the furthest graph from a hereditary property? Random Struct. Algorithms 33(1): 87-104 (2008)
3		Noga Alon, Asaf Shapira, Uri Stav: Can a Graph Have Distinct Regular Partitions? COCOON 2007: 428-438
1		Noga Alon, Uri Stav: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. Combinatorics, Probability & Computing 37(6): 795-807 (2004)